Pages that link to "Computational complexity theory"
The following pages link to Computational complexity theory:
Displayed 50 items.
- NP (complexity) (← links | edit)
- NC (complexity) (← links | edit)
- Oracle machine (← links | edit)
- Polynomial (← links | edit)
- Pseudorandomness (← links | edit)
- Presburger arithmetic (← links | edit)
- Primitive recursive function (← links | edit)
- RSA cryptosystem (← links | edit)
- Regular language (← links | edit)
- General recursive function (← links | edit)
- Statistical inference (← links | edit)
- Shogi (← links | edit)
- ♯P (← links | edit)
- ♯P-complete (← links | edit)
- Sorting algorithm (← links | edit)
- Square root (← links | edit)
- Tetris (← links | edit)
- Theory of computation (← links | edit)
- Turing machine (← links | edit)
- Theory (← links | edit)
- Turing Award (← links | edit)
- Travelling salesman problem (← links | edit)
- Unary numeral system (← links | edit)
- Novikov self-consistency principle (← links | edit)
- PSPACE (← links | edit)
- Stephen Cook (← links | edit)
- Blum Blum Shub (← links | edit)
- Wafer (electronics) (← links | edit)
- Data mining (← links | edit)
- Perfect matching (← links | edit)
- Big O notation (← links | edit)
- Pseudorandom number generator (← links | edit)
- Communication complexity (← links | edit)
- Mathematical optimization (← links | edit)
- Gabriel Lamé (← links | edit)
- Sokoban (← links | edit)
- Co-NP-complete (← links | edit)
- NP-hardness (← links | edit)
- P-complete (← links | edit)
- PSPACE-complete (← links | edit)
- NP-easy (← links | edit)
- NP-equivalent (← links | edit)
- EXPTIME (← links | edit)
- EXPSPACE (← links | edit)
- RP (complexity) (← links | edit)
- ZPP (complexity) (← links | edit)
- Adi Shamir (← links | edit)
- Gödel's incompleteness theorems (← links | edit)
- Number sign (← links | edit)
- History of logic (← links | edit)