Pages that link to "Item:Q1365675"
From MaRDI portal
The following pages link to On randomized versus deterministic computation (Q1365675):
Displaying 3 items.
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- Lower time bounds for randomized computation (Q4645177) (← links)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164) (← links)