메뉴 건너뛰기




Volumn , Issue , 2004, Pages 160-164

On parallel computation of Gröbner bases

Author keywords

[No Author keywords available]

Indexed keywords

BUCHBERGER ALGORITHM; LINEAR DIFFERENTIAL OPERATORS; NONCOMMUTATIVE SETTING; WEYL ALGEBRA;

EID: 10044271028     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2004.1328011     Document Type: Conference Paper
Times cited : (5)

References (12)
  • 1
    • 0030119340 scopus 로고    scopus 로고
    • Strategy-accurate parallel Buchberger algorithms
    • G. Attardi and C. Traverso. Strategy-accurate parallel Buchberger algorithms. J. Symbolic Comput., 21(4-6):411-425, 1996.
    • (1996) J. Symbolic Comput. , vol.21 , Issue.4-6 , pp. 411-425
    • Attardi, G.1    Traverso, C.2
  • 3
    • 0028757366 scopus 로고
    • Distributed data structures and algorithms for Gröbner basis computation
    • S. Chakrabarti and K. Yelick. Distributed data structures and algorithms for Gröbner basis computation. Lisp and Symbolic Computation, 7:1-27, 1994.
    • (1994) Lisp and Symbolic Computation , vol.7 , pp. 1-27
    • Chakrabarti, S.1    Yelick, K.2
  • 4
    • 0036045901 scopus 로고    scopus 로고
    • A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
    • J. Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In Proceedings of ISSAC 2002, pages 75-83, 2002.
    • (2002) Proceedings of ISSAC 2002 , pp. 75-83
    • Faugère, J.1
  • 5
    • 0001596387 scopus 로고
    • On an installation of Buchberger's algorithm
    • R. Gebauer and H. M. Möller. On an installation of Buchberger's algorithm. J. Symbolic Comput, 6(2-3):275-286, 1988.
    • (1988) J. Symbolic Comput , vol.6 , Issue.2-3 , pp. 275-286
    • Gebauer, R.1    Möller, H.M.2
  • 8
    • 84984647753 scopus 로고
    • Non-commutative Gröbner bases in algebras of solvable type
    • A. Kandri-Rody and V. Weispfenning. Non-commutative Gröbner bases in algebras of solvable type. J. Symbolic Computation, 9:1-26, 1990.
    • (1990) J. Symbolic Computation , vol.9 , pp. 1-26
    • Kandri-Rody, A.1    Weispfenning, V.2
  • 9
    • 0011507051 scopus 로고
    • A fine-grained parallel completion procedure
    • B. Reinhard, G. Manfred, and W. Küchlin. A fine-grained parallel completion procedure. In ISSAC 1994, pages 269-277, 1994.
    • (1994) ISSAC 1994 , pp. 269-277
    • Reinhard, B.1    Manfred, G.2    Küchlin, W.3
  • 10
    • 84862469810 scopus 로고    scopus 로고
    • Parallel computation of boolean Gröbner bases
    • Y. Sato and A. Suzuki. Parallel computation of boolean Gröbner bases. In Electronic Proceedings of ATCM 1999 (http://www.atcminc.com/ mPublications/EP/EPATCM99), 1999.
    • (1999) Electronic Proceedings of ATCM 1999
    • Sato, Y.1    Suzuki, A.2
  • 11
    • 84862480010 scopus 로고
    • A parallel factorization tree gröbner basis algorithm
    • RISC-Linz, Johannes Kepler University, Linz, Austria, Published in Proceedings, PASCO'94, World Scientific Publ. Comp.
    • K. Siegl. A Parallel Factorization Tree Gröbner Basis Algorithm. Technical Report 94-51, RISC-Linz, Johannes Kepler University, Linz, Austria, 1994. Published in Proceedings, PASCO'94, World Scientific Publ. Comp.
    • (1994) Technical Report , vol.94 , Issue.51
    • Siegl, K.1
  • 12
    • 11144356786 scopus 로고    scopus 로고
    • Bernstein-Sato ideals associated to polynomials
    • J. Ucha and F. Castro-Jiménez. Bernstein-Sato ideals associated to polynomials. Journal of Symbolic Computation, 37(5):629-639, 2004.
    • (2004) Journal of Symbolic Computation , vol.37 , Issue.5 , pp. 629-639
    • Ucha, J.1    Castro-Jiménez, F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.