메뉴 건너뛰기




Volumn , Issue , 2001, Pages 85-92

Towards factoring bivariate approximate polynomials

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIAL EQUATIONS; DIGITAL ARITHMETIC; ERROR ANALYSIS; INTEGRATION; ITERATIVE METHODS; MATRIX ALGEBRA; PARAMETER ESTIMATION; VECTORS;

EID: 0034782088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384114     Document Type: Conference Paper
Times cited : (36)

References (24)
  • 5
    • 4244077333 scopus 로고    scopus 로고
    • An elementary solution of a minimax problem arising in algorithms for automatic mesh selection
    • Tech. Rep. TR-00-10, The Ontario Research Centre for Computer Algebra, Dec
    • (2000)
    • Corless, R.M.1
  • 17
    • 0003043247 scopus 로고    scopus 로고
    • Challenges of symbolic computation: My favorite open problems
    • With an additional open problem by R. M. Corless and D. J. Jeffrey
    • (2000) Journal of Symbolic Computation , vol.29 , Issue.6 , pp. 891-919
    • Kaltofen, E.1
  • 19
    • 0031169815 scopus 로고    scopus 로고
    • Solving a polynomial equation: Some history and recent progress
    • (1997) SIAM Review , vol.39 , Issue.2 , pp. 187-220
    • Pan, V.Y.1


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