Pages that link to "Item:Q4037687"
From MaRDI portal
The following pages link to Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space (Q4037687):
Displaying 10 items.
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
- A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- A variant of inductive counting (Q1566745) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- A hierarchy that does not collapse : alternations in low level space (Q4365021) (← links)
