Related articles:
NP-hard
Complexity
NP-complete
NP (complexity)
Algorithm
Polynomial time
Knapsack problem
Boolean satisfiability problem
Integer factorization
Theory of computation
Big O notation
Computer science
Mathematics
Key terms:
problem
np
complexity
computational
algorithm
solved
pp
resources
solution
blum
yes
computational complexity
graph
instances
complexity class
stearns
efficient
polynomial time
intractable
deterministic
decision problems
theorem
computational complexity theory
computational resource
axiomatic
recursive
computer science
computational problems
axioms
boolean
complement
manuel blum
turing machine
parameterized complexity
problems that can be solved
ullman
hopcroft
complexity of algorithms
nondeterministic
graph isomorphism
oded
analyze
np problem
time complexity
running time
time or space
been shown
class of problems
big o notation
incomplete
Search external links cited by footnotes on Wikipedia page Computational complexity theory:
|
|