{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:37:17Z","timestamp":1742380637158},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01438278","type":"journal-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T07:08:15Z","timestamp":1113289695000},"page":"91-103","source":"Crossref","is-referenced-by-count":14,"title":["The complexity of sparse polynomial interpolation over finite fields"],"prefix":"10.1007","volume":"5","author":[{"given":"Kai","family":"Werther","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"301","volume":"20","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Tiwari, P.: A Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation. Proc. ACM STOC20, 301?309 (1988)","journal-title":"Proc. ACM STOC"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(91)90157-W","volume":"84","author":"M. Clausen","year":"1991","unstructured":"Clausen, M., Dress, A., Grabmeier, J., Karpinski, M.: On Zero-Testing and Interpolation ofk-sparse Multivariate Polynomials over Finite Fields. TCS84, 151?164 (1991)","journal-title":"TCS"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/0222046","volume":"22","author":"A. D\u00fcr","year":"1993","unstructured":"D\u00fcr, A., Grabmeier, J.: Applying Coding Theory to Sparse Interpolation, SIAM J. Comput.22, 695?704 (1993)","journal-title":"SIAM J. Comput."},{"key":"CR4","volume-title":"Concrete Mathematics. Reading","author":"R. L. Graham","year":"1989","unstructured":"Graham, R. L., Knuth, D. E., Patashnik, O.: Concrete Mathematics. Reading, Massachusetts: Addison-Wesley Publishing Company 1989"},{"key":"CR5","first-page":"166","volume":"28","author":"D. Y. Grigoriev","year":"1987","unstructured":"Grigoriev, D. Y., Karpinski, M.: The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in NC. Proc. IEEE FOCS28, 166?172 (1987)","journal-title":"Proc. IEEE FOCS"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/0219073","volume":"19","author":"D. Y. Grigoriev","year":"1990","unstructured":"Grigoriev, D. Y., Karpinski, M., Singer, M. F.: Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields. SIAM J. Comput.19, 1059?1063 (1990)","journal-title":"SIAM J. Comput."},{"key":"CR7","series-title":"385","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BFb0026299","volume-title":"Proc. CSL '88","author":"M. Karpinski","year":"1989","unstructured":"Karpinski, M.: Boolean Circuit Complexity of Algebraic Interpolation Problems. Proc. CSL '88, Lecture Notes in Computer Science Vol.385, 138?147. Berlin, Heidelberg, New York: Springer 1989"},{"key":"CR8","volume-title":"Introduction to finite fields and their applications","author":"R. Lidl","year":"1986","unstructured":"Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge, London, New York: Cambridge University Press 1986"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/0220019","volume":"20","author":"R. M. Roth","year":"1991","unstructured":"Roth, R. M., Benedek, G. M.: Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2). SIAM J. Comput.20, 291?314 (1991)","journal-title":"SIAM J. Comput."},{"key":"CR10","volume-title":"Diploma Thesis","author":"K. Werther","year":"1991","unstructured":"Werther, K.: Interpolation und Approximation Boolescher Formeln. Diploma Thesis, University of Bonn, FRG (1991)"},{"key":"CR11","volume-title":"Lecture Notes in Computer Science Vol. 72","author":"R. Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic Algorithms for Sparse Polynomials. Lecture Notes in Computer Science Vol. 72. Berlin, Heidelberg, New York: Springer 1979"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0747-7171(08)80018-1","volume":"9","author":"R. Zippel","year":"1990","unstructured":"Zippel, R.: Interpolating Polynomials from their Values. J. Symb. Comp.9, 375?403 (1990)","journal-title":"J. Symb. Comp."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01438278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01438278\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01438278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T14:01:35Z","timestamp":1556805695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01438278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01438278"],"URL":"https:\/\/doi.org\/10.1007\/bf01438278","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}