Pages that link to "Item:Q4632458"
From MaRDI portal
The following pages link to Lower space bounds for randomized computation (Q4632458):
Displayed 7 items.
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Lower time bounds for randomized computation (Q4645177) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Probabilistic rebound Turing machines (Q5958328) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)