Jump to content

User:Konetidy/Books/Computational Complexity

From Wikipedia, the free encyclopedia


Computational Complexity

[edit]

NP, P, NP Hard

[edit]
NP (complexity)
NP-hard
NP-complete
P versus NP problem
P = NP problem
Computational complexity theory
Complexity class
Polynomial time
Decision problem
Turing machine
Polynomial-time Turing reduction
Deterministic Turing machine
Non-deterministic Turing machine
Oracle machine
Algorithm
Nondeterministic algorithm
Deterministic algorithm