Reducing Randomness via Irrational Numbers
From MaRDI portal
Publication:4943867
DOI10.1137/S0097539798341600zbMath0960.68181MaRDI QIDQ4943867
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
Galois theory; parallel algorithms; randomized algorithms; program checking; perfect matchings; polynomial identification; multiset equality test
12F10: Separable extensions, Galois theory
65C10: Random number generation in numerical analysis
68W20: Randomized algorithms
Related Items
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in, On the minimum gap between sums of square roots of small integers, Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials, Efficient algorithms for sparse cyclotomic integer zero testing, Recent Results on Polynomial Identity Testing, Algebraic Independence and Blackbox Identity Testing