Computing zeta functions of large polynomial systems over finite fields

DOI10.1016/j.jco.2022.101681zbMath1498.11240arXiv2007.13214OpenAlexW3045470621WikidataQ113871709 ScholiaQ113871709MaRDI QIDQ2171948

J. Maurice Rojas, Daqing Wan, Qi Cheng

Publication date: 12 September 2022

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.13214

zbMATH Keywords

finite fieldscounting solutionsprogram verification

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Specification and verification (program logics, model checking, etc.) (68Q60) Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) (14G10) Varieties over finite and local fields (11G25)

Related Items (1)

An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
• Counting curves and their projections
• On exponential sums in finite fields. II
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
• Computing zeta functions of arithmetic schemes
• Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
• Universal equivalence and majority of probabilistic programs over finite fields
• Handbook of Elliptic and Hyperelliptic Curve Cryptography

This page was built for publication: Computing zeta functions of large polynomial systems over finite fields