Solvability of systems of polynomial congruences modulo a large prime

DOI10.1007/s000370050029zbMath0977.11054OpenAlexW2078088136MaRDI QIDQ1590076

R. Smith

Publication date: 22 January 2002

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

Full work available at URL: https://doi.org/10.1007/s000370050029

zbMATH Keywords

algorithmfinite fieldalgebraic setpolynomial congruence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (6)

An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ On the computation of rational solutions of underdetermined systems over a finite field ⋮ Algorithms for modular counting of roots of multivariate polynomials ⋮ Improved explicit estimates on the number of solutions of equations over a finite field ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Fast computation of a rational point of a variety over a finite field

This page was built for publication: Solvability of systems of polynomial congruences modulo a large prime