Category:Computational problems
 | Computing portal |
Here is a list of articles in the Computational problems category of the Computing portal that unifies foundations of mathematics and computations using computers. This category lists computational problems, formal problems in theoretical computer science which are studied in computational complexity theory.
Subcategories
This category has the following 5 subcategories, out of 5 total.
C
D
N
P
Pages in category "Computational problems"
The following 30 pages are in this category, out of 30 total.
- Computational problem (computing)
A
- AI-complete (computing)
- Art gallery problem (computing)
C
- Circuit satisfiability problem (computing)
- Circuit Value Problem (computing)
- Computing the permanent (computing)
- Counting problem (complexity) (computing)
- Covering problems (computing)
D
- Decision problem (computing)
- Dining philosophers problem (computing)
- Dutch national flag problem (computing)
F
- Function problem (computing)
G
- Gap reduction (computing)
J
- Josephus problem (computing)
L
- Linear search problem (computing)
- List of PPAD-complete problems (computing)
N
- N-body problem (physics)
O
- Optimization problem (computing)
P
- Sharp-P-completeness of 01-permanent (computing)
- ♯P-completeness of 01-permanent (computing)
- Predecessor problem (computing)
- Promise problem (computing)
R
- Ring learning with errors (computing)
S
- Search problem (computing)
- Sharp-SAT (computing)
- Short integer solution problem (computing)
- Sum of radicals (computing)
T
- Tutte polynomial (computing)
U
- Unknotting problem (computing)
W
- Word problem (mathematics) (computing)
Mathematics
Organizations
Books
About