Pages that link to "NL (complexity)"
Jump to navigation
Jump to search
The following pages link to NL (complexity):
Displaying 35 items.
- Computational complexity theory (← links)
- Entscheidungsproblem (← links)
- Greatest common divisor (← links)
- NC (complexity) (← links)
- PSPACE (← links)
- Polynomial-time reduction (← links)
- Transitive closure (← links)
- Space complexity (← links)
- Many-one reduction (← links)
- 2-satisfiability (← links)
- Complexity class (← links)
- Savitch's theorem (← links)
- NSPACE (← links)
- Cook–Levin theorem (← links)
- Space hierarchy theorem (← links)
- Reduction (complexity) (← links)
- List of unsolved problems in computer science (← links)
- SL (complexity) (← links)
- Descriptive complexity theory (← links)
- Finite model theory (← links)
- Book embedding (← links)
- Two-way finite automaton (← links)
- First-order reduction (← links)
- Read-only Turing machine (← links)
- Certificate (complexity) (← links)
- Structural complexity theory (← links)
- Sardinas–Patterson algorithm (← links)
- Isolation lemma (← links)
- Configuration graph (← links)
- Circuits over sets of natural numbers (← links)
- Integer circuit (← links)
- CC (complexity) (← links)
- PL (complexity) (← links)
- Fixed-point logic (← links)
- State complexity (← links)