메뉴 건너뛰기




Volumn 27, Issue 1, 1999, Pages 21-29

A polynomial time algorithm for diophantine equations in one variable

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0032615314     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1998.0242     Document Type: Article
Times cited : (42)

References (8)
  • 3
    • 0016939583 scopus 로고
    • Fast multiple-precision evaluation of elementary functions
    • Brent, R. (1976). Fast multiple-precision evaluation of elementary functions. J. ACM, 23, 242-251.
    • (1976) J. ACM , vol.23 , pp. 242-251
    • Brent, R.1
  • 7
    • 84976779342 scopus 로고
    • Fast probabilistic algorithms for verification of polynomial identities
    • Schwartz, J. (1980). Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27, 701-717.
    • (1980) J. ACM , vol.27 , pp. 701-717
    • Schwartz, J.1
  • 8
    • 0001861435 scopus 로고
    • Some remarks on Bezout's theorem and complexity theory
    • Hirsch, M., Marsden, J. and Shub, M., eds., Berlin, Springer
    • Shub, M. (1993). Some remarks on Bezout's theorem and complexity theory. In Hirsch, M., Marsden, J. and Shub, M., eds. From Topology to Computation: Proceedings of the Smalefest, pp. 443-455. Berlin, Springer.
    • (1993) From Topology to Computation: Proceedings of the Smalefest , pp. 443-455
    • Shub, M.1


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