|
Related articles:
NP-complete
Computational complexity theory
Boolean satisfiability problem
Key terms: problem np polynomial h decision problem if polynomial time problems in np reduction complexity halting problem hardest class all problems does call turing definition algorithm solved example solved in polynomial time machine oracle turing reduction optimization problem all problems in np hence Search external links cited by footnotes on Wikipedia page NP-hard: |
|