![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
Найди десять ошибок
Feb. 20th, 2007 09:02 amЧего в нижеследующих 4-х предложениях больше - правильных утверждений или наоборот?
On paper at least, quantum computers promise to reduce dramatically the time needed to solve a range of mathematical tasks known as NP-complete problems. One famous example is the travelling salesman problem—finding the shortest route between several cities. This is a puzzle that increases exponentially in complexity with the number of cities considered. The reason is that every possible permutation needs to be looked at in order to find the best.
On paper at least, quantum computers promise to reduce dramatically the time needed to solve a range of mathematical tasks known as NP-complete problems. One famous example is the travelling salesman problem—finding the shortest route between several cities. This is a puzzle that increases exponentially in complexity with the number of cities considered. The reason is that every possible permutation needs to be looked at in order to find the best.
