Related terms:
polynomial time
optimization problem
independent set
complexity theory
complexity class
computational complexity
halting problem
about natural numbers
statements about natural numbers
all problems in np
all problems
weaker form
problems solvable
problem in np
solved in polynomial time
satisfiability
decidable
principle of optimality
subgraph isomorphism
problema
solvable
Wikipedia sources:
Decision problem
Computational complexity theory
NP-hard
Undecidable problem
NP-complete
Analytic Hierarchy Process
Bellman equation
NP (complexity)
Halting problem
Subgraph isomorphism problem
Dynamic programming
Sharp-P
PP (complexity)
Presburger arithmetic
Optimization problem
P versus NP problem
3-dimensional matching
Boolean satisfiability problem
Maximum cut
Computational problem
Independent set (graph theory)
Knapsack problem
Polynomial hierarchy
Vertex cover
P-complete
Context for words:
decision
problem
|
|