Category:Computational problems
Jump to navigation
Jump to search
Template:Sister project This category lists computational problems, formal problems in theoretical computer science which are studied in computational complexity theory.
Subcategories
This category has the following 6 subcategories, out of 6 total.
N
- NL-complete problems (2 P)
P
- P-complete problems (3 P)
- Polynomial-time problems (12 P)
- PSPACE-complete problems (10 P)
S
Script error: No such module "anchor".Pages in category "Computational problems"
The following 14 pages are in this category, out of 14 total.