{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:38:23Z","timestamp":1765960703017},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T00:00:00Z","timestamp":1323993600000},"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":[[2012,11]]},"DOI":"10.1007\/s00200-011-0160-6","type":"journal-article","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T23:40:33Z","timestamp":1323906033000},"page":"129-141","source":"Crossref","is-referenced-by-count":8,"title":["Polynomial evaluation over finite fields: new algorithms and complexity bounds"],"prefix":"10.1007","volume":"23","author":[{"given":"Michele","family":"Elia","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Schipani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,16]]},"reference":[{"key":"160_CR1","volume-title":"Theory and Practice of Error Control Codes","author":"R.E. Blahut","year":"1983","unstructured":"Blahut R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1983)"},{"key":"160_CR2","volume-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"A. Borodin","year":"1975","unstructured":"Borodin A., Munro I.: The Computational Complexity of Algebraic and Numeric Problems. Elsevier, New York (1975)"},{"issue":"4","key":"160_CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/ett.982","volume":"15","author":"E. Costa","year":"2004","unstructured":"Costa E., Fedorenko S.V., Trifonov P.V.: On computing the syndrome polynomial in Reed-Solomon decoder. Eur. Trans. Telecommun. 15(4), 337\u2013342 (2004)","journal-title":"Eur. Trans. Telecommun."},{"issue":"3","key":"160_CR4","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/12.990131","volume":"51","author":"M. Elia","year":"2002","unstructured":"Elia M., Leone M.: On the inherent space complexity of fast parallel multipliers for GF(2 m ). IEEE Trans. Comput. 51(3), 346\u2013351 (2002)","journal-title":"IEEE Trans. Comput."},{"key":"160_CR5","unstructured":"Interlando, J.C., Byrne, E., Rosenthal, J.: The gate complexity of syndrome decoding of Hamming codes. In: Proceeding of 10th International Conference on Applications of Computer Algebra, pp. 33\u201337 (2004)"},{"key":"160_CR6","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 University Press, Cambridge (1986)"},{"key":"160_CR7","volume-title":"The Art of Computer Programming, Seminumerical Algorithms, vol II","author":"D.E. Knuth","year":"1981","unstructured":"Knuth D.E.: The Art of Computer Programming, Seminumerical Algorithms, vol II. Addison-Wesley, Reading (1981)"},{"key":"160_CR8","first-page":"103","volume":"21","author":"V.Y. Pan","year":"1966","unstructured":"Pan V.Y.: Methods of computing values of polynomials. Uspekhi Mat. Nauk 21, 103\u2013134 (1966)","journal-title":"Uspekhi Mat. Nauk"},{"key":"160_CR9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"M. Paterson","year":"1973","unstructured":"Paterson M., Stockmeyer L.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2, 60\u201366 (1973)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"160_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1109\/TC.1978.1675088","volume":"C-27","author":"D.V. Sarwate","year":"1978","unstructured":"Sarwate D.V.: Semi-fast fourier transforms over GF(2 m ). IEEE Trans. Comput. C-27(3), 283\u2013285 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"160_CR11","unstructured":"Schipani, D., Elia, M., Rosenthal, J.: On the decoding complexity of cyclic codes up to the BCH bound. In: Proceeding of International Symposium on Information Theory (ISIT), 2011"},{"key":"160_CR12","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, New York (1977)"},{"key":"160_CR13","volume-title":"Reed-Solomon Codes and their Applications","year":"1994","unstructured":"Wicker, S.B., Bhargava, V.K. (eds): Reed-Solomon Codes and their Applications. IEEE Press, Piscataway (1994)"},{"issue":"5","key":"160_CR14","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1073\/pnas.58.5.1840","volume":"58","author":"S. Winograd","year":"1967","unstructured":"Winograd S.: On the number of multiplications required to compute certain functions. Proc. Natl. Acad. Sci. USA 58(5), 1840\u20131842 (1967)","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-011-0160-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-011-0160-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-011-0160-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:23Z","timestamp":1558610663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-011-0160-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,16]]},"references-count":14,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s00200-011-0160-6","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,16]]}}}