|
Related articles:
NP-complete
Polynomial time
Computational complexity theory
Key terms: np problem proof sum class subset verifier path accept algorithm yes complexity zero decision integer whether exists contains cities route definition turing machine if there proof string bits polynomial time certificate answer solvable input np problem follows distance nondeterministic class np problems in np less than decision problem equivalent subset sum problem all problems there exists complexity theory np is the set accepting path complexity class decision version deterministic turing machine class of problems traveling salesman Search external links cited by footnotes on Wikipedia page NP (complexity): |
|