Category:Computational problems

C

• Computational problems in graph theory‎ (4 C, 73 P)

D

• Distributed computing problems‎ (2 C, 32 P)

N

• NL-complete problems‎ (2 P)
• NP-complete problems‎ (9 C, 77 P)
• NP-hard problems‎ (1 C, 19 P)

P

• P-complete problems‎ (3 P)
• Polynomial-time problems‎ (18 P)
• PSPACE-complete problems‎ (18 P)

R

• Reconfiguration‎ (7 P)

S

• Satisfiability problems‎ (2 C, 15 P)
• Problems on strings‎ (11 P)

U

• Undecidable problems‎ (23 P)

• Computational problem

A

• AI-complete

C

• Circuit satisfiability problem
• Circuit Value Problem
• Computing the permanent
• Counting problem (complexity)

D

• Decision problem
• Dining philosophers problem
• Dutch national flag problem

F

• Function problem

G

• Gap reduction

J

• Josephus problem

L

• Linear search problem
• List of PPAD-complete problems

M

• Maximum inner-product search
• Monotone dualization

N

• N-body problem

O

• Optimization problem

P

• ♯P-completeness of 01-permanent
• Predecessor problem
• Promise problem

R

• Ring learning with errors

S

• Search problem
• Sharp-SAT
• Short integer solution problem
• Square-root sum problem
• Sum of radicals

T

• Tutte polynomial

U

• Unknotting problem

W

• Word problem (mathematics)