Approximating the Number of Zeroes of a GF[2] Polynomial
From MaRDI portal
Publication:4033769
DOI10.1006/jagm.1993.1014zbMath0769.11047MaRDI QIDQ4033769
Publication date: 16 May 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1014
11Y16: Number-theoretic algorithms; complexity
11T06: Polynomials over finite fields
11T55: Arithmetic theory of polynomial rings over finite fields
Related Items
Efficiently testing sparse \(\text{GF}(2)\) polynomials, Counting curves and their projections, On some approximation problems concerning sparse polynomials over finite fields, Efficient construction of a small hitting set for combinatorial rectangles in high dimension, Algorithms for modular counting of roots of multivariate polynomials