Related articles:
NP-complete
Sharp-P
Decision problem
NP-hard
Co-NP
NP (complexity)
Boolean satisfiability problem
Graph isomorphism problem
BQP
Knapsack problem
Theory of computation
Randomized algorithm
Nondeterministic algorithm
PSPACE
Algorithm
Stephen Cook
Graph isomorphism
List of important publications in theoretical computer science
P (complexity)
EXPTIME
Presburger arithmetic
Analysis of algorithms
Manuel Blum
General number field sieve
Computability theory
Formal language
Theoretical computer science
Combinatorics
RSA
Mathematics
Key terms:
problem
complexity
computational
algorithm
turing machine
solve
complexity classes
complexity theory
decision problem
bounds
polynomial
polynomial time
factorization
deterministic turing machine
computational complexity
complexity measures
pspace
computational complexity theory
nondeterministic
integer factorization
graph isomorphism
lower bounds
important complexity
bpp
integer factorization problem
problems that can be solved
space hierarchy theorem
nondeterministic turing
intractable
problems solvable
probabilistic
problems in np
important complexity classes
theoretical computer science
deciding whether
input string
squaring
efficient algorithm
quicksort
computability theory
adjacency
probabilistic turing machine
upper and lower bounds
graph isomorphism problem
many complexity classes
multiplying two
Search external links cited by footnotes on Wikipedia page Computational complexity theory:
|
|