Approximating the Number of Zeroes of a GF[2] Polynomial

DOI10.1006/JAGM.1993.1014MaRDI QIDQ4033769zbMATH OpenOpenAlexFDO

Authors Michael Luby, Marek Karpinski

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

zbMATH Keywords

probabilistic polynomial time algorithmzeros of polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1186969
• On some approximation problems concerning sparse polynomials over finite fields
• scientific article; zbMATH DE number 1188985
• On the zeros of Boolean polynomials
• Counting curves and their projections

Cited in

(8)

• 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
• scientific article; zbMATH DE number 1186969 (Why is no real title available?)
• Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
• Efficient constructions of hitting sets for systems of linear functions
• Efficiently testing sparse \(\text{GF}(2)\) polynomials
• Counting curves and their projections

This page was built for publication: Approximating the Number of Zeroes of a GF[2] Polynomial

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