A Gröbner Free Alternative for Polynomial System Solving
Authors:
- Marc GiustiMGMarc Giusti
- Grégoire LecerfGLGrégoire Lecerf
- Bruno SalvyBSBruno Salvy
- 1 March 2001
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 17 (1) , 154-211
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Converting Bases with the Gröbner WalkJournal of Symbolic Computation, 1997
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993
- Some algebraic and geometric computations in PSPACE1988
- Matrix multiplication via arithmetic progressions1987
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- The complexity of partial derivativesTheoretical Computer Science, 1983
- Exact solution of linear equations usingP-adic expansionsNumerische Mathematik, 1982
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Triangular factorization and inversion by fast matrix multiplicationMathematics of Computation, 1974