Reducing Randomness via Irrational Numbers
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (4) , 1247-1256
- https://doi.org/10.1137/s0097539798341600
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related ProblemsSIAM Journal on Computing, 1995
- Designing programs that check their workJournal of the ACM, 1995
- Complexity of parallel matrix computationsTheoretical Computer Science, 1987
- Constructing a perfect matching is in random NCCombinatorica, 1986
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General GraphsSIAM Journal on Computing, 1986
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- A probabilistic remark on algebraic program testingInformation Processing Letters, 1978
- The Factors of GraphsCanadian Journal of Mathematics, 1952