On the computation of rational solutions of underdetermined systems over a finite field

DOI10.1016/J.JCO.2022.101712MaRDI QIDQ2685068zbMATH OpenOpenAlexFDO

Authors Nardo Giménez, Mariana Pérez, Melina Privitelli, Guillermo Matera

Publication date 17 February 2023

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

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

zbMATH Keywords

finite fieldsrational solutionsaverage-case complexityprobability of successunderdetermined systemsreduced regular sequences

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Varieties over finite and local fields (11G25) Rational points (14G05) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15)

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3859276 (Why is no real title available?)
• scientific article; zbMATH DE number 3897078 (Why is no real title available?)
• scientific article; zbMATH DE number 52497 (Why is no real title available?)
• scientific article; zbMATH DE number 621807 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases (F₄)
• Analytic combinatorics
• Comparison Between XL and Gröbner Basis Algorithms
• Computing one billion roots using the tangent Graeffe method
• Computing parametric geometric resolutions
• Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
• Definability and fast quantifier elimination in algebraically closed fields
• Deterministic root finding over finite fields using Graeffe transforms
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Fast computation of a rational point of a variety over a finite field
• Finding Points on Curves over Finite Fields
• Generic local structure of the morphisms in commutative algebra
• Handbook of finite fields
• Hybrid approach for solving multivariate systems over finite fields
• Improved explicit estimates on the number of solutions of equations over a finite field
• Introduction to algebraic geometry
• La conjecture de Weil. I
• Lectures on results on Bezout's theorem. Notes by D. P. Patil
• Modern computer algebra
• Number of Points of Varieties in Finite Fields
• On the complexity exponent of polynomial system solving
• On the complexity of the \(F_5\) Gröbner basis algorithm
• On the computation of rational points of a hypersurface over a finite field
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• Randomized root finding over finite FFT-fields using tangent Graeffe transforms
• Solvability of systems of polynomial congruences modulo a large prime

Cited in

(2)

• On the computation of rational solutions of underdetermined systems over a finite field
• Rationality criteria and application to the generating series of a system of equations with coefficients in a local field

Describes a project that uses

Uses Software

• FGb

This page was built for publication: On the computation of rational solutions of underdetermined systems over a finite field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685068)