메뉴 건너뛰기




Volumn , Issue , 2003, Pages 37-44

Tellegen's Principle into Practice

Author keywords

Computer algebra; Interpolation; Polynomial evaluation; Tellegen's principle; Transposition principle

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; CONFORMAL MAPPING; INTERPOLATION; OBJECT ORIENTED PROGRAMMING; POLYNOMIALS; TREES (MATHEMATICS); VECTORS;

EID: 1542270107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/860854.860870     Document Type: Conference Paper
Times cited : (102)

References (23)
  • 3
    • 0347057324 scopus 로고
    • Inter-reciprocity applied to electrical networks
    • J. L. Bordewijk. Inter-reciprocity applied to electrical networks. Appl. Sci. Res. B., 6:1-74, 1956.
    • (1956) Appl. Sci. Res. B. , vol.6 , pp. 1-74
    • Bordewijk, J.L.1
  • 5
    • 85033467252 scopus 로고
    • Solving systems of non-linear polynomial equations faster
    • ACM
    • J. Canny, E. Kaltofen, and L. Yagati. Solving systems of non-linear polynomial equations faster. In Proceedings of ISSAC'89, pages 121-128. ACM, 1989.
    • (1989) Proceedings of ISSAC'89 , pp. 121-128
    • Canny, J.1    Kaltofen, E.2    Yagati, L.3
  • 9
    • 1542298022 scopus 로고    scopus 로고
    • The middle product algorithm, I. Speeding up the division and square root of power series
    • RR INRIA 4664
    • G. Hanrot, M. Quercia, and P. Zimmermann. The middle product algorithm, I. Speeding up the division and square root of power series. Technical report, RR INRIA 4664, 2002.
    • (2002) Technical Report
    • Hanrot, G.1    Quercia, M.2    Zimmermann, P.3
  • 11
    • 1542327981 scopus 로고
    • Duality applied to the complexity of matrix multiplication and other bilinear forms
    • J. Hopcroft and J. Musinski. Duality applied to the complexity of matrix multiplication and other bilinear forms. SIAM Journal on Computing, 2:159-173, 1973.
    • (1973) SIAM Journal on Computing , vol.2 , pp. 159-173
    • Hopcroft, J.1    Musinski, J.2
  • 12
    • 0003043247 scopus 로고    scopus 로고
    • Challenges of symbolic computation: My favorite open problems
    • E. Kaltofen. Challenges of symbolic computation: my favorite open problems. Journal of Symbolic Computation, 29(6):891-919, 2000.
    • (2000) Journal of Symbolic Computation , vol.29 , Issue.6 , pp. 891-919
    • Kaltofen, E.1
  • 13
    • 84976789477 scopus 로고
    • Improved sparse multivariate polynomial interpolation algorithms
    • P. Gianni, editor. Springer Verlag
    • E. Kaltofen and L. Yagati. Improved sparse multivariate polynomial interpolation algorithms. In P. Gianni, editor, Proceedings of ISSAC'88, volume 358 of LNCS, pages 467-474. Springer Verlag, 1989.
    • (1989) Proceedings of ISSAC'88, volume 358 of LNCS , pp. 467-474
    • Kaltofen, E.1    Yagati, L.2
  • 14
    • 0040170055 scopus 로고
    • Addition requirements for matrix and transposed matrix products
    • M. Kaminski, D. Kirkpatrick, and N. Bshouty. Addition requirements for matrix and transposed matrix products. Journal of Algorithms, 9(3):354-364, 1988.
    • (1988) Journal of Algorithms , vol.9 , Issue.3 , pp. 354-364
    • Kaminski, M.1    Kirkpatrick, D.2    Bshouty, N.3
  • 19
    • 84971235488 scopus 로고
    • A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
    • ACM
    • V. Shoup. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. In Proceedings of ISSAC'91, pages 14-21. ACM, 1991.
    • (1991) Proceedings of ISSAC'91 , pp. 14-21
    • Shoup, V.1
  • 20
    • 0001465210 scopus 로고
    • A new polynomial factorization algorithm and its implementation
    • V. Shoup. A new polynomial factorization algorithm and its implementation. Journal of Symbolic Computation, 20(4):363-397, 1995.
    • (1995) Journal of Symbolic Computation , vol.20 , Issue.4 , pp. 363-397
    • Shoup, V.1
  • 21
    • 0346163812 scopus 로고    scopus 로고
    • Efficient computation of minimal polynomials in algebraic extensions of finite fields
    • ACM
    • V. Shoup. Efficient computation of minimal polynomials in algebraic extensions of finite fields. In Proceedings of ISSAC'99, pages 53-58. ACM, 1999.
    • (1999) Proceedings of ISSAC'99 , pp. 53-58
    • Shoup, V.1
  • 22
    • 0001460351 scopus 로고
    • A general network theorem, with applications
    • B. Tellegen. A general network theorem, with applications. Philips Research Reports, 7:259-269, 1952.
    • (1952) Philips Research Reports , vol.7 , pp. 259-269
    • Tellegen, B.1
  • 23
    • 0000595168 scopus 로고
    • Interpolating polynomials from their values
    • R. Zippel. Interpolating polynomials from their values. Journal of Symbolic Computation, 9(3):375-403, 1990.
    • (1990) Journal of Symbolic Computation , vol.9 , Issue.3 , pp. 375-403
    • Zippel, R.1


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