{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:13Z","timestamp":1725662953445},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095194"},{"type":"electronic","value":"9783540351283"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09519-5_84","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:45:25Z","timestamp":1330188325000},"page":"317-329","source":"Crossref","is-referenced-by-count":5,"title":["Factoring univariate integral polynomials in polynomial average time"],"prefix":"10.1007","author":[{"given":"George E.","family":"Collins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"33_CR1","unstructured":"Berlekamp, E. R. Algebraic Coding Theory. McGraw-Hill, 1968."},{"key":"33_CR2","unstructured":"Collins, G.E., and Musser, D.R. The SAC-l Polynomial Factorization System. Technical Report #157, Computer Sciences Department, Univ. of Wisconsin-Madison, March 1972."},{"key":"33_CR3","unstructured":"Frobenius, F.G. \u00dcber Beziehungen zwischen den Primidealen eines algebraischen K\u00f6rpers und den Substitutionen seiner Gruppe. (1896). Gesammelte Abhandlungen II."},{"key":"33_CR4","unstructured":"Janusz, G.J. Algebraic Number Fields. Academic Press, 1973."},{"key":"33_CR5","unstructured":"Knuth, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley, 1968."},{"key":"33_CR6","unstructured":"Knuth, D.E. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, 1968."},{"key":"33_CR7","unstructured":"Musser, D.R. Algorithms for Polynomial Factorization. (Ph.D. thesis). Technical Report #134, Computer Sciences Department, Univ. of Wisconsin-Madison, Sept. 1974."},{"issue":"2","key":"33_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/321879.321890","volume":"22","author":"D. R. Musser","year":"1975","unstructured":"Musser, D.R. Multivariate Polynomial Factorization. Jour. ACM, Vol. 22, No. 2 (April 1975), pp. 291\u2013308.","journal-title":"Jour. ACM"},{"issue":"2","key":"33_CR9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/322063.322071","volume":"25","author":"D. R. Musser","year":"1978","unstructured":"Musser, D.R. On the Efficiency of a Polynomial Irreducibility Test. Jour. ACM, Vol. 25, No. 2 (April 1978), pp. 271\u2013282.","journal-title":"Jour. ACM"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01449123","volume":"109","author":"B. L. Waerden van der","year":"1936","unstructured":"van der Waerden, B.L. Die Seltenheit der Gleichungen mit Affekt. Math. Ann. 109 (1936), pp. 13\u201316.","journal-title":"Math. Ann."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"van der Waerden, B.L. Modern Algebra, Vol. 1. Ungar, 1948.","DOI":"10.1007\/978-1-4684-9999-5_1"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09519-5_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:01:17Z","timestamp":1605643277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09519-5_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095194","9783540351283"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-09519-5_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}