Change of order for bivariate triangular sets

Authors:
Cyril Pascal;Éric Schost
Affiliations:
École polytechnique, Palaiseau, France;École polytechnique, Palaiseau, France
Venue:
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Year:
2006

Citing 23
Cited 14

Fast parallel absolute irreducibility testing

Journal of Symbolic Computation
Ideal Bases and Primary Decomposition: Case of Two Variables

Journal of Symbolic Computation
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Integration of rational functions: Rational computation of the logarithmic part

Journal of Symbolic Computation
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Solving zero-dimensional algebraic systems

Journal of Symbolic Computation
On computing determinants of matrices without divisions

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
Fast construction of irreducible polynomials over finite fields

Journal of Symbolic Computation
From algebraic sets to monomial linear bases by means of combinatorial algorithms

Proceedings of the 4th conference on Formal power series and algebraic combinatorics
A new polynomial factorization algorithm and its implementation

Journal of Symbolic Computation
Modern computer algebra

Modern computer algebra
Efficient computation of minimal polynomials in algebraic extensions of finite fields

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Challenges of symbolic computation: my favorite open problems

Journal of Symbolic Computation
Using Galois ideals for computing relative resolvents

Journal of Symbolic Computation - Algorithmic methods in Galois Theory
PARDI!

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
About a New Method for Computing in Algebraic Number Fields

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Algebraic factoring and rational function integration

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Tellegen's principle into practice

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Lifting techniques for triangular decompositions

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Fast computation of special resultants

Journal of Symbolic Computation
Algebraic Complexity Theory

Algebraic Complexity Theory

Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Change of order for regular chains in positive dimension

Theoretical Computer Science
Fast arithmetics in artin-schreier towers over finite fields

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
transalpyne: a language for automatic transposition

ACM Communications in Computer Algebra
Almost linear time operations with triangular sets

ACM Communications in Computer Algebra
transalpyne: a language for automatic transposition

ACM Communications in Computer Algebra
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Univariate real root isolation in an extension field

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Genus 2 point counting over prime fields

Journal of Symbolic Computation
Fast arithmetics in Artin-Schreier towers over finite fields

Journal of Symbolic Computation
On the complexity of computing with zero-dimensional triangular sets

Journal of Symbolic Computation
Univariate real root isolation in multiple extension fields

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
On the complexity of solving bivariate systems: the case of non-singular solutions

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Modular Composition Modulo Triangular Sets and Applications

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Changing the order of variables in bivariate triangular sets has applications in Trager's factorization algorithm, or in rational function integration. We discuss the complexity of this question, using baby steps / giant steps techniques and trace formulas, obtaining subquadratic estimates.