Bivariate polynomial reduction and elimination ideal over finite fields

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Modular composition modulo triangular sets and applications
Discrete logarithms in \(\mathrm{GF}(p)\)
Gröbner bases and primary decomposition of polynomial ideals
Displacement ranks of matrices and linear equations
Fast projection methods for minimal design problems in linear system theory
Résolution des systèmes d'équations algébriques
Exact solution of linear equations using p-adic expansions
Solving zero-dimensional algebraic systems
Inversion components of block Hankel-like matrices
Solving zero-dimensional systems through the rational univariate representation
Fast parallel algorithms for matrix reduction to normal forms
Fast algorithms for zero-dimensional polynomial systems using duality
Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
Efficient computation of dual space and directional multiplicity of an isolated point
Sparse FGLM algorithms
On the complexity of the Lickteig-Roy subresultant algorithm
Ideal basis and primary decompositions: case of two variables
A new polynomial factorization algorithm and its implementation
Multivariate polynomials, duality, and structured matrices
Fast computation of generic bivariate resultants
Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
Fast multivariate multi-point evaluation revisited
Fast computation of special resultants
On the complexity exponent of polynomial system solving
Change of order for bivariate triangular sets
On the complexity of solving bivariate systems
Fast Polynomial Factorization and Modular Composition
Inter-reciprocity applied to electrical networks
Sub-cubic change of ordering for Gröbner basis
Solving sparse linear equations over finite fields
Fast Algorithms for Manipulating Formal Power Series
Modern computer algebra
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
Subquadratic-time factoring of polynomials over finite fields
On the Complexity of Multivariate Polynomial Division
Using Algebraic Geometry
Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
On Computing the Resultant of Generic Bivariate Polynomials
Change of Basis for m-primary Ideals in One and Two Variables
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
Fast construction of irreducible polynomials over finite fields
Fast construction of irreducible polynomials over finite fields
Subresultants and the Shape Lemma
p-adic algorithm for bivariate Gröbner bases
Elimination ideal and bivariate resultant over finite fields
High-order lifting for polynomial Sylvester matrices
Newton iteration for lexicographic Gr\"obner bases in two variables

This page was built for publication: Bivariate polynomial reduction and elimination ideal over finite fields

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