Usage of Modular Techniques for Efficient Computation of Ideal Operations
- 19 December 2017
- journal article
- research article
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 12 (1) , 1-32
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Efficient Arithmetic in Successive Algebraic Extension Fields Using SymmetriesMathematics in Computer Science, 2012
- Bit-size estimates for triangular sets in positive dimensionJournal of Complexity, 2012
- An approach to solving systems of polynomials via modular arithmetics with applicationsJournal of Computational and Applied Mathematics, 2011
- Parallelization of Modular AlgorithmsJournal of Symbolic Computation, 2011
- Linearizability of linear systems perturbed by fifth degree homogeneous polynomialsJournal of Physics A: Mathematical and Theoretical, 2007
- Implementation of prime decomposition of polynomial ideals over small finite fieldsJournal of Symbolic Computation, 2004
- Modular algorithms for computing Gröbner basesJournal of Symbolic Computation, 2003
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- On lucky ideals for Gröbner basis computationsJournal of Symbolic Computation, 1992
- A p-adic approach to the computation ofGröbner basesJournal of Symbolic Computation, 1988