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

DOI10.1006/JAGM.1993.1014zbMATH Open0769.11047OpenAlexW2055756054MaRDI QIDQ4033769FDOQ4033769

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

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

zbMATH Keywords

zeros of polynomialprobabilistic polynomial time algorithm

Mathematics Subject Classification ID

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

Cited In (8)

• Efficient constructions of hitting sets for systems of linear functions
• Counting curves and their projections
• Algorithms for modular counting of roots of multivariate polynomials
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• Title not available (Why is that?)
• Efficiently testing sparse \(\text{GF}(2)\) polynomials
• On some approximation problems concerning sparse polynomials over finite fields
• Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits

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)