Almost linear time operations with triangular sets

Authors:
Xavier Dahan;Marc Moreno Maza;Éric Schost;Adrien Poteaux
Affiliations:
Kyûshû University, Fukuoka, Japan;University of Western Ontario, London, ON;University of Western Ontario, London, ON;Johannes Kepler University, Linz, Austria
Venue:
ACM Communications in Computer Algebra
Year:
2011

A generalized Euclidean algorithm for computing triangular representations of algebraic varieties

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

Journal of Symbolic Computation
On the theories of triangular sets

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
PARDI!

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Complexity results for triangular sets

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Lifting techniques for triangular decompositions

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Fast arithmetic for triangular sets: From theory to practice

Journal of Symbolic Computation
Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems

SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation

Hi-index	0.00