메뉴 건너뛰기




Volumn 117-118, Issue , 1997, Pages 145-175

Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031139053     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(97)00009-1     Document Type: Article
Times cited : (15)

References (15)
  • 2
    • 0003445158 scopus 로고
    • Chaps. 1-7 (Actualités Sci. Indust., Nos. 1290, 1293, 1308, 1314, Paris 1964
    • N. Bourbaki, Algèbre Commutative, Chaps. 1-7 (Actualités Sci. Indust., Nos. 1290, 1293, 1308, 1314, Paris 1961, 1964, 1965).
    • (1961) Algèbre Commutative
    • Bourbaki, N.1
  • 3
    • 0030187917 scopus 로고    scopus 로고
    • Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
    • A.L. Chistov, Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic, J. Symbol. Comput. 22 (1) (1996) 1-25.
    • (1996) J. Symbol. Comput. , vol.22 , Issue.1 , pp. 1-25
    • Chistov, A.L.1
  • 6
    • 0001103577 scopus 로고
    • Polynomial complexity algorithm for factoring polynomials and constructing components of a variety in subexponential time
    • (in Russian) [English transl.: J. Sov. Math. 34 (4) (1986)]
    • A.L. Chistov, Polynomial complexity algorithm for factoring polynomials and constructing components of a variety in subexponential time, Zap. Nauchn. Semin. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 137 (1984) 124-188 (in Russian) [English transl.: J. Sov. Math. 34 (4) (1986)].
    • (1984) Zap. Nauchn. Semin. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) , vol.137 , pp. 124-188
    • Chistov, A.L.1
  • 7
    • 0000868828 scopus 로고
    • Polynomial complexity of the Newton-Puiseux algorithm
    • Springer, New York
    • A.L. Chistov. Polynomial complexity of the Newton-Puiseux algorithm, in: Lecture Notes in Computer Science, Vol. 233 (Springer, New York, 1986) 247-255.
    • (1986) Lecture Notes in Computer Science , vol.233 , pp. 247-255
    • Chistov, A.L.1
  • 8
    • 0001103578 scopus 로고
    • Polynomial complexity algorithms for computational problems in the theory of algebraic curves
    • (in Russian) [English transl. in: J. Sov. Math.]
    • A.L. Chistov, Polynomial complexity algorithms for computational problems in the theory of algebraic curves, Zap. Nauchn. Semin. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 176 (1989) 124-188 (in Russian) [English transl. in: J. Sov. Math.].
    • (1989) Zap. Nauchn. Semin. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) , vol.176 , pp. 124-188
    • Chistov, A.L.1
  • 10
    • 0000936391 scopus 로고
    • La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial
    • Cortona
    • M. Giusti and J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, Proc. Int. Meeting on Commutative Algebra, Cortona (1991).
    • (1991) Proc. Int. Meeting on Commutative Algebra
    • Giusti, M.1    Heintz, J.2
  • 12
    • 0002548511 scopus 로고
    • Résolution des systèmes d'équations algébrique
    • D. Lazard, Résolution des systèmes d'équations algébrique, Theoret. Comput. Sci. 15 (1981) 77-110.
    • (1981) Theoret. Comput. Sci. , vol.15 , pp. 77-110
    • Lazard, D.1
  • 14
    • 84966260816 scopus 로고
    • On Betti numbers of real varieties
    • J. Milnor, On Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (2) (1964) 275-280.
    • (1964) Proc. Amer. Math. Soc. , vol.15 , Issue.2 , pp. 275-280
    • Milnor, J.1


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