Pages that link to "Item:Q4388881"
From MaRDI portal
The following pages link to Space-Efficient Deterministic Simulation of Probabilistic Automata (Q4388881):
Displaying 8 items.
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Division in logspace-uniform<i>NC</i><sup>1</sup> (Q2773023) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)
