<--- Back to Details
First PageDocument Content
Complexity classes / NP-hard / P versus NP problem / NP / P / Bounded-error probabilistic polynomial / Oracle machine / Reduction / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2006-08-04 16:47:47
Complexity classes
NP-hard
P versus NP problem
NP
P
Bounded-error probabilistic polynomial
Oracle machine
Reduction
Time complexity
Theoretical computer science
Computational complexity theory
Applied mathematics

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive