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

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

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

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

Uses Software

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)