메뉴 건너뛰기




Volumn 30, Issue 4, 2000, Pages 451-467

A fast algorithm for gröbner basis conversion and its applications

(1)  Tran, Quoc Nam a  

a NONE

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0006763357     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0416     Document Type: Article
Times cited : (12)

References (25)
  • 6
    • 0346158896 scopus 로고    scopus 로고
    • D. Bayer, 1982
    • D. Bayer, 1982.
  • 7
    • 0346789472 scopus 로고    scopus 로고
    • B. Buchberger, 1965
    • B. Buchberger, 1965.
  • 8
    • 0002803133 scopus 로고
    • Gröbner bases: An algorithmic method in polynomial ideal theory
    • N. K. Bose. Dodrecht: Reidel Publishing Company
    • Buchberger B. Gröbner bases: An algorithmic method in polynomial ideal theory. Bose N. K. Multidimensional Systems Theory. 1985;184-232 Reidel Publishing Company, Dodrecht.
    • (1985) Multidimensional Systems Theory , pp. 184-232
    • Buchberger, B.1
  • 10
    • 0001804016 scopus 로고
    • Equations for the projective closure and effective nullstellensatz
    • Caniglia L., Galligo A., Heintz J. Equations for the projective closure and effective nullstellensatz. Discrete Appl. Math. 33:1991;11-23.
    • (1991) Discrete Appl. Math. , vol.33 , pp. 11-23
    • Caniglia, L.1    Galligo, A.2    Heintz, J.3
  • 13
    • 0025474826 scopus 로고
    • The structure of polynomial ideals and Gröbner bases
    • Dubé T. D. The structure of polynomial ideals and Gröbner bases. SIAM J. Comput. 19:1990;750-773.
    • (1990) SIAM J. Comput. , vol.19 , pp. 750-773
    • Dubé, T.D.1
  • 15
    • 25944479355 scopus 로고
    • Efficient computation of zero-dimensional Gröbner bases by change of ordering
    • Faugère F. C., Gianni P., Lazard D., Mora T. Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comput. 16:1993;329-344.
    • (1993) J. Symb. Comput. , vol.16 , pp. 329-344
    • Faugère, F.C.1    Gianni, P.2    Lazard, D.3    Mora, T.4
  • 16
    • 84972579210 scopus 로고
    • The orthocentric simplex as an extreme simplex
    • Gerber L. The orthocentric simplex as an extreme simplex. Pac. J. Math. 56:1975;97-111.
    • (1975) Pac. J. Math. , vol.56 , pp. 97-111
    • Gerber, L.1
  • 18
    • 84944291571 scopus 로고
    • Implicit curves and surfaces in CAGD
    • Hoffmann C. Implicit curves and surfaces in CAGD. IEEE Comput. Graph. Appl. 13:1993;79-88.
    • (1993) IEEE Comput. Graph. Appl. , vol.13 , pp. 79-88
    • Hoffmann, C.1
  • 19
    • 0348050435 scopus 로고    scopus 로고
    • On the complexity of Gröbner bases conversion
    • Kalkbrener M. On the complexity of Gröbner bases conversion. J. Symb. Comput. 28:1999;265-274.
    • (1999) J. Symb. Comput. , vol.28 , pp. 265-274
    • Kalkbrener, M.1
  • 20
    • 0347419901 scopus 로고    scopus 로고
    • Automated geometric reasoning: Dixon resultants, Gröbner bases and characteristic sets
    • D. Wang. Springer
    • Kapur D. Automated geometric reasoning: Dixon resultants, Gröbner bases and characteristic sets. Wang D. Automated Deduction in Geometry. 1998;1-36 Springer.
    • (1998) Automated Deduction in Geometry , pp. 1-36
    • Kapur, D.1
  • 24
    • 0030268743 scopus 로고    scopus 로고
    • Hilbert functions and the Buchberger algorithm
    • Traverso C. Hilbert functions and the Buchberger algorithm. J. Symb. Comput. 22:1996;355-376.
    • (1996) J. Symb. Comput. , vol.22 , pp. 355-376
    • Traverso, C.1


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