Reducing Randomness via Irrational Numbers

DOI10.1137/S0097539798341600zbMath0960.68181OpenAlexW2079560560MaRDI QIDQ4943867

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 theoryparallel algorithmsrandomized algorithmsprogram checkingperfect matchingspolynomial identificationmultiset equality test

Mathematics Subject Classification ID

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

Related Items (6)

Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials ⋮ Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ⋮ Recent Results on Polynomial Identity Testing ⋮ Algebraic Independence and Blackbox Identity Testing ⋮ Efficient algorithms for sparse cyclotomic integer zero testing ⋮ On the minimum gap between sums of square roots of small integers

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