The following pages link to (Q3975178):
Displaying 6 items.
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- On comparative complexity of probabilistic and deterministic automata (Q3979858) (← links)
- Lower bounds for one-way probabilistic communication complexity (Q4630264) (← links)
- Lower bounds for the state complexity of probabilistic languages and the language of prime numbers (Q5108020) (← links)
- Probabilism versus Alternation for Automata (Q6163621) (← links)
- The complexity of probabilistic versus deterministic finite automata (Q6487443) (← links)