Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science
On some variations of two-way probabilistic finite automata models
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...