\#P-completeness of counting roots of a sparse polynomial

DOI10.1016/J.IPL.2018.09.008zbMath1470.68048OpenAlexW2952909128MaRDI QIDQ1628696

Alexey Milovanov

Publication date: 5 December 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.09.008

zbMATH Keywords

computational complexityfinite fields\#P-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Polynomials over finite fields (11T06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Counting curves and their projections
• Finding Isomorphisms Between Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \#P-completeness of counting roots of a sparse polynomial