메뉴 건너뛰기
Information Processing Letters
Volumn 61, Issue 6, 1997, Pages 303-309
On learning multivariate polynomials under the uniform distribution
Author keywords

Fields; Multivariate polynomials; PAC learning; Queries
Indexed keywords

EID: 0043136257     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00021-5     Document Type: Article
Times cited : (10)
References (9)
  • 1
    • 0000710299 scopus 로고
    • Queries and concept learning
    • D. Angluin, Queries and concept learning, Machine Learning 2 (4) (1988) 319-342.
    • (1988) Machine Learning , vol.2 , Issue.4 , pp. 319-342
    • Angluin, D.1
  • 2
    • 84898974734 scopus 로고
    • A deterministic algorithm for sparse multivariate polynomial interpolation
    • M. Ben-Or and P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, in: Proc. 20th Ann. ACM Symp. on Theory of Computing (1988) 301-309.
    • (1988) Proc. 20th Ann. ACM Symp. on Theory of Computing , pp. 301-309
    • Ben-Or, M.1    Tiwari, P.2
  • 3
    • 0007563290 scopus 로고
    • Learning boolean functions in an infinite attribute space
    • A. Blum, Learning boolean functions in an infinite attribute space, Machine Learning 9 (4) (1992) 373-386.
    • (1992) Machine Learning , vol.9 , Issue.4 , pp. 373-386
    • Blum, A.1
  • 4
    • 0026189928 scopus 로고
    • On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
    • M. Clausen, A. Dress, J. Grabmeier and M. Karpinski, On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields, Theoret. Comput. Sci. 84 (1991) 151-164.
    • (1991) Theoret. Comput. Sci. , vol.84 , pp. 151-164
    • Clausen, M.1    Dress, A.2    Grabmeier, J.3    Karpinski, M.4
  • 5
    • 0025694134 scopus 로고
    • Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
    • D.Yu. Grigoriev, M. Karpinski and M.F. Singers, Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields, SIAM J. Comput. 19 (6) (1990) 1059-1063.
    • (1990) SIAM J. Comput. , vol.19 , Issue.6 , pp. 1059-1063
    • Grigoriev, D.Yu.1    Karpinski, M.2    Singers, M.F.3
  • 6
    • 0029292087 scopus 로고
    • Randomized interpolation and approximation of sparse polynomials
    • Y. Mansour, Randomized interpolation and approximation of sparse polynomials, SIAM J. Comput. 24 (2) (1995) 357-368.
    • (1995) SIAM J. Comput. , vol.24 , Issue.2 , pp. 357-368
    • Mansour, Y.1
  • 7
    • 0026136717 scopus 로고
    • Interpolation and approximation of sparse multivariate polynomials over GF(2)
    • M. Ron Roth and G. Benedek, Interpolation and approximation of sparse multivariate polynomials over GF(2), SIAM J. Comput. 20 (2) (1991) 291-314.
    • (1991) SIAM J. Comput. , vol.20 , Issue.2 , pp. 291-314
    • Ron Roth, M.1    Benedek, G.2
  • 8
    • 0030126034 scopus 로고    scopus 로고
    • Learning sparse multivariate polynomial over a field with queries and counterexamples
    • R.E. Schapire and L.M. Sellie, Learning sparse multivariate polynomial over a field with queries and counterexamples, J. Comput. System Sci. 52 (2) (1996) 201-213.
    • (1996) J. Comput. System Sci. , vol.52 , Issue.2 , pp. 201-213
    • Schapire, R.E.1    Sellie, L.M.2
  • 9
    • 0000595168 scopus 로고
    • Interpolating polynomials from their values
    • R. Zippel, Interpolating polynomials from their values, J. Symbolic Comput. 9 (1990) 375-403.
    • (1990) J. Symbolic Comput. , vol.9 , pp. 375-403
    • Zippel, R.1

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