Pages that link to "Item:Q1235980"
From MaRDI portal
The following pages link to Relating refined space complexity classes (Q1235980):
Displaying 27 items.
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- A space-hierarchy result on two-dimensional alternating Turing machines with only universal states (Q1057650) (← links)
- Complexity lower bounds for machine computing models (Q1057651) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Cyclic automata (Q1100919) (← links)
- Simultaneous (poly-time, log-space) lower bounds (Q1102116) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Hierarchy of complexity of computation of partial functions with values 0 and 1 (Q1149431) (← links)
- A survey of space complexity (Q1193412) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- Domino-tiling games (Q1822501) (← links)
- Characterization of realizable space complexities (Q1892934) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Gradually intractable problems and nondeterministic log-space lower bounds (Q3700836) (← links)
- On two-way weak counter machines (Q3766856) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- (Q3885190) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES (Q5704375) (← links)
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies (Q6114832) (← links)
