User:Pvertenten/Books/Complexity Theory

Complexity Theory

 * Algorithm
 * Computational complexity theory
 * Big O notation
 * Complement (complexity)
 * Polynomial
 * Polynomial-time reduction
 * Complexity class
 * Time complexity
 * DTIME
 * P (complexity)
 * EXPTIME
 * NP (complexity)
 * NTIME
 * NEXPTIME
 * P versus NP problem
 * NP-hardness
 * Co-NP
 * PSPACE
 * L (complexity)
 * NL (complexity)
 * DSPACE
 * Decision problem
 * Non-deterministic Turing machine
 * NP-completeness
 * Time hierarchy theorem
 * Turing machine
 * Alternating Turing machine
 * Space hierarchy theorem
 * Travelling salesman problem
 * Boolean satisfiability problem