Pages that link to "Item:Q5896095"

The following pages link to State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis (Q5896095):

Displayed 5 items.

• 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)