Back to Results
First PageMeta Content
Complexity classes / NP-hard / NP-complete / NP / P versus NP problem / P / Reduction / Decision problem / Oracle machine / Theoretical computer science / Computational complexity theory / Applied mathematics


Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions
Add to Reading List

Document Date: 2008-09-30 17:00:23

Open Document

File Size: 133,91 KB

Share Result on Facebook
UPDATE