Pages that link to "Non-deterministic Turing machine"
From HandWiki
The following pages link to Non-deterministic Turing machine:
Displayed 38 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Computational complexity theory (← links)
- Computational complexity (← links)
- Dovetailing (computer science) (← links)
- NP-completeness (← links)
- Parallel computation thesis (← links)
- Probabilistic Turing machine (← links)
- Sharp-SAT (← links)
- St-connectivity (← links)
- Time complexity (← links)
- Turing machine (← links)
- Computation tree (← links)
- DSPACE (← links)
- Log-space computable function (← links)
- NSPACE (← links)
- NTIME (← links)
- Iterated logarithm (← links)
- List of computability and complexity topics (← links)
- Padding argument (← links)
- P versus NP problem (← links)
- Theoretical computer science (← links)
- Book embedding (← links)
- Fagin's theorem (← links)
- Indeterminacy in concurrent computation (← links)
- True quantified Boolean formula (← links)
- Recursive language (← links)
- Turing machine equivalents (← links)
- Alternating Turing machine (← links)
- EXPSPACE (← links)
- Linear speedup theorem (← links)
- Unambiguous Turing machine (← links)
- NE (complexity) (← links)
- ♯P-complete (← links)
- Sharp-P-complete (← links)
- Co-NP (← links)
- P (complexity) (← links)
- NEXPTIME (← links)
- Biography:Endre Szemerédi (← links)
- Biography:Ronald Fagin (← links)
