Factoring polynomials using fewer random bits
From MaRDI portal
Publication:912919
DOI10.1016/S0747-7171(08)80011-9zbMath0699.12027MaRDI QIDQ912919
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
11T06: Polynomials over finite fields
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
Distinct Degree Factorizations for Polynomials over a Finite Field, On Bivariate Polynomial Factorization over Finite Fields, Factoring polynomials over finite fields: A survey, Bounds on tradeoffs between randomness and communication complexity, On the deterministic complexity of factoring polynomials over finite fields, On the degrees of irreducible factors of polynomials over a finite field, Primality testing with fewer random bits
Cites Work