{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:44Z","timestamp":1725456764587},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029653","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"538-544","source":"Crossref","is-referenced-by-count":0,"title":["Computing large polynomial powers very fast in parallel"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Zeugmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"Borodin, A., On relating time and space to size and depth. SIAM J. Comp. 6, (1977), 733\u2013744.","journal-title":"SIAM J. Comp."},{"key":"62_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S.A. Cook","year":"1985","unstructured":"Cook, S.A., A taxonomy of problems with fast parallel algorithms. Information and Control 64, (1985), 2\u201322.","journal-title":"Information and Control"},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Eberly, W., Very fast matrix and polynomial arithmetic. Proc. 25th Annual Symp. on Foundations of Computer Science, IEEE (1984), pp. 21\u201330.","DOI":"10.1109\/SFCS.1984.715897"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Fich, F.E. and M. Tompa, The parallel complexity of exponentiating polynomials over finite fields. J. Assoc. Comp. Mach. 35, 651\u2013667","DOI":"10.1145\/44483.44496"},{"key":"62_CR5","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","volume":"13","author":"J. Gathen von zur","year":"1984","unstructured":"von zur Gathen, J., Parallel algorithms for algebraic problems. SIAM J. Comp. 13, (1984), 802\u2013824.","journal-title":"SIAM J. Comp."},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Parallel arithmetic computations: a survey. Proc. 12th Internat. Symp. Math. Foundations of Computer Science, Bratislava 1986, Lecture Notes in Computer Science 233, pp. 93\u2013112, Springer.","DOI":"10.1007\/BFb0016236"},{"key":"62_CR7","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1137\/0216060","volume":"16","author":"J. Gathen von zur","year":"1987","unstructured":"von zur Gathen, J., Computing powers in parallel. SIAM J. Comp. 16, (1987), 930\u2013945.","journal-title":"SIAM J. Comp."},{"key":"62_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BFb0040375","volume":"319","author":"B.E. Litow","year":"1988","unstructured":"Litow, B.E. and G.I. Davida, O(log n) parallel time finite field inversion, Proc. Aegean Workshop on Computing, (1988) Lecture Notes in Computer Science 319, pp. 74\u201380, Springer.","journal-title":"Lecture Notes in Computer Science"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Reif, J.M. and S.R. Tate, Optimal size integer division circuits, Proc. 21th Annual ACM Symposium on Theory of Computing, Seattle, (1989), pp. 264\u2013273.","DOI":"10.1145\/73007.73032"},{"key":"62_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1524\/itit.1989.31.1.59","volume":"31","author":"R. Reischuk","year":"1989","unstructured":"Reischuk, R., Parallele Maschinenmodelle und Komplexit\u00e4tsklassen, Informationstechnik it 31, (1989), 59\u201377.","journal-title":"Informationstechnik it"},{"key":"62_CR11","first-page":"223","volume-title":"Encyclopedia of Computer Science and Technology, Vol. 21, Supplement 6","author":"T. Zeugmann","year":"1990","unstructured":"Zeugmann, T., Parallel algorithms. (1990), Encyclopedia of Computer Science and Technology, Vol. 21, Supplement 6, Allen Kent and James G. Williams (Eds.), pp. 223\u2013244, Marcel Dekker Inc., New York and Basel."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T20:12:26Z","timestamp":1626811946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0029653","relation":{},"subject":[]}}