canonical complexity class

(definition)

Definition: One of the classes defined by logarithmic, polynomial, and exponential bounds on time and space, for deterministic and nondeterministic machines. These classify most of the important computational problems.

Note: From Algorithms and Theory of Computation Handbook, page 27-21, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A

More information

Scott Aaronson's Complexity Zoo

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 5 January 2021.
HTML page formatted Wed Oct 30 12:15:30 2024.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "canonical complexity class", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 5 January 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/canonical.html