The following pages link to (Q5111278):
Displaying 3 items.
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)
