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