Pages that link to "Item:Q1685795"
From MaRDI portal
The following pages link to Parameterized graph connectivity and polynomial-time sub-linear-space short reductions (preliminary report) (Q1685795):
Displaying 4 items.
- Relating Sublinear Space Computability Among Graph Connectivity and Related Problems (Q2794336) (← links)
- 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)