| |
| | complexity class (Site not responding. Last check: 2007-10-14) |
 | | Definition: Any of a set of computational problems with the same bounds (Θ(n)) on time and space, for deterministic and nondeterministic machines. |
 | | P, NP, NP-complete, NP-hard, BPP, canonical complexity class. |
 | | Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "complexity class", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. |
| www.nist.gov /dads/HTML/complexityClass.html (136 words) |
|