Pages that link to "Item:Q1271619"
From MaRDI portal
The following pages link to Bridging across the \(\log(n)\) space frontier (Q1271619):
Displaying 14 items.
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\) (Q1094139) (← 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)
- Positive relativizations for log space computability (Q2639638) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- Space bounded computations: Review and new separation results (Q3975135) (← links)
- Nondeterministic Computations in Sublogarithmic Space and Space Constructibility (Q3978779) (← links)
- Logical Approaches to Computational Barriers (Q5898804) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5919539) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5920059) (← links)
