메뉴 건너뛰기




Volumn 33, Issue 5, 2002, Pages 661-677

Irreducible decomposition of curves

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0036328149     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2000.0528     Document Type: Article
Times cited : (20)

References (20)
  • 2
    • 0034777193 scopus 로고    scopus 로고
    • Semi-numerical determination of irreducible branches of a reduced space curve
    • Proceedings of International Symposium on Symbolic and Algebraic Computation ACM Press
    • (2001) , pp. 137-142
    • Galligo, A.1    Ruppecht, D.2
  • 3
    • 0030659946 scopus 로고    scopus 로고
    • An absolute primality test for bivariate polynomials
    • Proceedings of International Symposium on Symbolic and Algebraic Computation ACM Press
    • (1997) , pp. 217-224
    • Galligo, A.1    Watt, S.2
  • 4
    • 0000750175 scopus 로고
    • Algorithmes-disons rapides-pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionelles
    • Proceedings of MEGA'90, Birkhäuser, of Progress in Mathematics
    • (1991) , vol.94 , pp. 169-194
    • Giusti, M.1    Heintz, J.2
  • 6
    • 0004152174 scopus 로고    scopus 로고
    • Quadratic newton iteration for systems with multiplicity
    • J. FoCM., to appear
    • (2001)
    • Lecerf, G.1
  • 7
    • 0004281096 scopus 로고    scopus 로고
    • Une alternative aux methodes de reecriture pour la resolution des systemes algebriques
    • Ph.D. Thesis, École polytechnique, France
    • (2001)
    • Lecerf, G.1
  • 8
    • 85021258787 scopus 로고    scopus 로고
    • MEDICIS, Unite Mixte de Service CNRS/Polytechnique en calcul formel
  • 10
    • 85021287250 scopus 로고    scopus 로고
    • Magma
    • (2001)
  • 12
    • 0003624396 scopus 로고    scopus 로고
    • Elements pour un calcul approche et certifie: Etude du PGCD et de la factorisation
    • Ph.D. Thesis, University of Nice, France
    • (2000)
    • Ruppecht, D.1
  • 14
    • 0034782199 scopus 로고    scopus 로고
    • Approximate multivariate polynomial factorization based on zero-sum relations
    • Proceedings of International Symposium on Symbolic and Algebraic Computation, ACM Press
    • (2001) , pp. 284-291
    • Sasaki, T.1
  • 16
    • 4243721208 scopus 로고    scopus 로고
    • Sur la résolution des systèmes polynomiaux à paramètres
    • Ph.D. Thesis, École polytechnique, France
    • (2000)
    • Schost, E.1
  • 17
    • 0001969302 scopus 로고    scopus 로고
    • Using monodromy to decompose solution sets of polynomial systems into irreducible components
    • Ciliberto, C., Hirzebruch, F., Miranda, R., Teicher, M. eds, Proceedings of a NATO Conference, February 25-March 1, 2001, Eilat, Israel, Application of Algebraic Geometry to Coding Theory, Physics and Publishers
    • (2001) , pp. 297-315
    • Sommese, A.J.1    Verschelde, J.2    Wampler, C.W.3


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