Elimination ideal and bivariate resultant over finite fields

DOI10.1145/3597066.3597100arXiv2302.08891MaRDI QIDQ6081978

Gilles Villard

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

Chinese Remainder Theorem for bivariate lexicographic Gröbner bases ⋮ High-order lifting for polynomial Sylvester matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Résolution des systèmes d'équations algébriques
• 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
• 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
• 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
• 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

This page was built for publication: Elimination ideal and bivariate resultant over finite fields