On the parallel computation of comprehensive Gröbner systems

PASCO'07: Proceedings of the 2007 International Workshop on Parallel Symbolic Computation

Volumn , Issue , 2007, Pages 99-101

  Inoue, Shutaro ^a   Sato, Yosuke ^a  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

Author keywords

Comprehensive Gr bner system

Indexed keywords

ALGORITHMS; INFORMATION SYSTEMS; PROBLEM SOLVING;

PARALLEL COMPUTATION;

PARALLEL PROCESSING SYSTEMS;

EID: 36949021792     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1278177.1278196     Document Type: Article

References (9)

1. Kapur, D. (1995). An Approach for Solving Systems of Parametric Polynomial Equations, in Principles and Practices of Constraint Programming, (eds. Saraswat and Van Hentenryck), MIT Press, 217-244.
2. Montes, A. (2002). A new algorithm for discussing Gröbner bases with parameters. J. Symb. Comp. 33/2, 183-208.
3. Manubens, M. and Montes, A. (2006). Improving DISPGB algorithm using the discriminant ideal. J. Symb. Comp. 41, 1245-1263.
4. Noro, M. and Takeshima, T. (1992). Risa/Asir - A Computer Algebra System. International Symposium on Symbolic and Algebraic Computation (ISSAC 92), Proceedings, 387-396.
5. Suzuki, A. and Sato, Y. (2003). An Alternative approach to Comprehensive Gröbner Bases. J. Symb. Comp. 36/3-4, 649-667.
6. Suzuki, A. and Sato, Y. (2006). A Simple Algorithm to Compute Comprehensive Gröbner Bases Using Gröbner Bases. International Symposium on Symbolic and Algebraic Computation (ISSAC 2006), Proceedings, 326-331.
7. Weispfenning, V. (1992). Comprehensive Gröbner bases, J. Symb. Comp. 14/1, 1-29.
8. Weispfenning, V. (2003). Canonical Comprehensive Gröbner bases, J. Symb. Comp. 36, 669-683.
9. Takayama, N. etc. Open message eXchange protocol for Mathematics, http://www.math.kobe-u.ac.jp/OpenXM/