Category:Computational complexity theory

Subcategories

There are 2 subcategories to this category.

C

• Complexity classes

N

• NP-complete problems

Articles in category "Computational complexity theory"

There are 28 articles in this category.

2-satisfiability A Accounting method Advice (complexity theory) Algorithmic topology Analysis of algorithms Approximation algorithm Arthur-Merlin protocol B Best and worst cases Best-case performance

C Complexity class Computational complexity theory Computationally expensive Constructible function Cook's theorem D Descriptive complexity F Fixed-parameter algorithm Function problem L Log-space reduction M Many-one reduction

N Natural proof Nondeterministic algorithm P Polynomial-time reduction Problem size R Reduction (complexity) S Savitch's theorem Space complexity T Time hierarchy theorem Turing reduction