Reducing Randomness via Irrational Numbers

DOI10.1137/S0097539798341600MaRDI QIDQ4943867zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Ming-Yang Kao

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539798341600

zbMATH Keywords

Galois theorymultiset equality testparallel algorithmsperfect matchingspolynomial identificationprogram checkingrandomized algorithms

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Random number generation in numerical analysis (65C10) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 1559535
• Randomness and reducibility
• scientific article; zbMATH DE number 1834658
• A Rational Route to Randomness
• Using irreducible polynomials for random number generation
• scientific article; zbMATH DE number 3081769
• Using Rademacher permutations to reduce randomness
• Randomness and arithmetic

Cited in

(8)

• Efficient algorithms for sparse cyclotomic integer zero testing
• Recent results on polynomial identity testing
• Algebraic independence and blackbox identity testing
• Using Rademacher permutations to reduce randomness
• Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
• Identity testing for radical expressions
• Cyclotomic identity testing and applications
• On the minimum gap between sums of square roots of small integers

This page was built for publication: Reducing Randomness via Irrational Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943867)