Related articles:
NP-complete
Decision problem
NP-hard
Boolean satisfiability problem
NP (complexity)
Integer factorization
Polynomial time
Theory of computation
P (complexity)
Graph isomorphism
Computer science
Analysis of algorithms
Knapsack problem
Algorithm
Combinatorics
Formal language
Key terms:
problem
complexity
computational
solve
turing machine
decision problems
complexity classes
bounds
deterministic
computational problem
decision problems solvable
computational complexity theory
hierarchy theorems
problems solvable by a deterministic
solvable by a deterministic turing
nondeterministic turing machine
complexity measures
polynomial time
problem instances
turing machine within time
input size
problems solvable by a nondeterministic
solvable by a nondeterministic turing
space hierarchy theorem
pspace
intractable
np problem
graph isomorphism problem
turing machine using at most
dspace
theoretical computer science
problems that can be solved
efficient algorithm
integer factorization
squaring
deterministic turing machine using
input string
adjacency
upper and lower bounds
particular algorithm
all possible algorithms
important complexity
problems in np
many complexity classes
complexity classes are based
nondeterministic turing machine within time
multiplying two
computational model
logarithmic space
complexity of solving the problem
Search external links cited by footnotes on Wikipedia page Computational complexity theory:
|
|