Pages that link to "Item:Q5047164"
From MaRDI portal
The following pages link to Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164):
Displaying 20 items.
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Optimal speedup of Las Vegas algorithms (Q689615) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Iterative arrays with self-verifying communication cell (Q2278569) (← links)
- Probabilistic computability and choice (Q2346414) (← links)
- Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
- Las Vegas Computability and Algorithmic Randomness (Q2954989) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- On the power of Las Vegas II: Two-way finite automata (Q5958109) (← links)
- Self-verifying Cellular Automata (Q6108530) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
- Iterative arrays with self-verifying communication cell (Q6195133) (← links)
