Algorithms for Modular Counting of Roots of Multivariate Polynomials
DOI10.1007/11682462_51zbMath1143.11362OpenAlexW2663933503MaRDI QIDQ3525790
Parikshit Gopalan, Richard J. Lipton, Venkatesan Guruswami
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_51
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decoding (94B35)
This page was built for publication: Algorithms for Modular Counting of Roots of Multivariate Polynomials
