Pages that link to "Nondeterministic Turing machine"
From HandWiki
The following pages link to Nondeterministic Turing machine:
Displayed 42 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Angelic non-determinism (← links)
- Cook–Levin theorem (← links)
- IP (complexity) (← links)
- NP-completeness (← links)
- Probabilistic Turing machine (← links)
- Sardinas–Patterson algorithm (← links)
- Time hierarchy theorem (← links)
- Turing machine (← links)
- Certificate (complexity) (← links)
- DTIME (← links)
- Interactive proof system (← links)
- Leaf language (← links)
- Nondeterministic algorithm (← links)
- Complexity class (← links)
- Implicit graph (← links)
- P versus NP problem (← links)
- Abstract machine (← links)
- Epsilon transition (← links)
- Nondeterministic finite automaton (← links)
- Automata theory (← links)
- Busy beaver (← links)
- Graph isomorphism problem (← links)
- Unbounded nondeterminism (← links)
- NP (complexity) (← links)
- NL (complexity) (← links)
- Parity P (← links)
- Context-sensitive language (← links)
- RP (complexity) (← links)
- Savitch's theorem (← links)
- Nondeterministic Turing machine (transclusion) (← links)
- NL-complete (← links)
- Unrestricted grammar (← links)
- EXPTIME (← links)
- L (complexity) (← links)
- Valiant–Vazirani theorem (← links)
- PP (complexity) (← links)
- Exponential hierarchy (← links)
- PSPACE (← links)
- ♯P (← links)
- Parsing expression grammar (← links)
- Polynomial creativity (← links)
- NLIN (← links)
