Pages that link to "Item:Q5896095"
From MaRDI portal
The following pages link to State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095):
Displaying 11 items.
- Parameterized graph connectivity and polynomial-time sub-linear-space short reductions (preliminary report) (Q1685795) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q5111278) (← links)
- State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- (Q5919705) (redirect page) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)
- Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)
- Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters (Q6636064) (← links)
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (Q6646016) (← links)
