unsolved conjecture), the complexity of every NP-complete problem is for every positive integer .

Use in algorithm design

Evaluating the complexity of an algorithm is an important part of algorithm design, as this gives useful information on the performance that may be expected.

It is a common misconception that the evaluation of the complexity of algorithms will become less important as a result of Moore's law,

1.Previous
3.Next