Related terms:
space hierarchy theorem
many complexity classes
important complexity classes
important complexity
probabilistic turing machine
decision problems
deterministic turing machine
problems solvable
strongly polynomial
deciding whether
integer factorization problem
another problem
complexity measures
nondeterministic turing
defined using
any polynomial
efficient algorithm
two integers
upper and lower bounds
input size
hierarchy theorem
multiplying two
double exponential
polynomial time algorithm
squaring
lower bounds
graph isomorphism problem
more precisely
complexity classes
problems in np
Wikipedia sources:
Time complexity
Computational complexity theory
Complexity class
Context for words:
problems
that
can
be
solved
|
|