{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:23Z","timestamp":1725663323677},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540128687"},{"type":"electronic","value":"9783540387565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12868-9_106","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:56:20Z","timestamp":1330192580000},"page":"225-235","source":"Crossref","is-referenced-by-count":7,"title":["Early detection of true factors in univariate polynomial factorization"],"prefix":"10.1007","author":[{"given":"Paul S.","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","volume":"46","author":"E. R. Berlekamp","year":"1967","unstructured":"E. R. Berlekamp, \"Factoring Polynomials over Finite Fields,\" Bell System Tech. J., V. 46, 1967, pp. 1853\u20131859.","journal-title":"Bell System Tech. J."},{"key":"22_CR2","unstructured":"J. H. Griesmer, R. D. Jenks and D. Y. Yun, \"SCRATCHPAD User's Manual,\" IBM Research ReportRA70, June 1975."},{"key":"22_CR3","unstructured":"A. C. Hearn, REDUCE II a system for Algebraic Computation, The University of Utah, Computer Sciences Department, 1979."},{"key":"22_CR4","volume-title":"On the Complexity of Factoring Polynomials with integer Coefficients","author":"E. Kaltofen","year":"1982","unstructured":"E. Kaltofen, \"On the Complexity of Factoring Polynomials with integer Coefficients,\" Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, New York, December 1982."},{"key":"22_CR5","unstructured":"A. K. Lenstra, H. W. Lenstra, and L. Lovasz, \"Factoring Polynomials with Rational Coefficients,\" Report 82-05, Amsterdam Mathematisch Instituut, Universiteit van Amsterdam, 1982."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1090\/S0025-5718-1974-0354624-3","volume":"28","author":"M. Mignotte","year":"1974","unstructured":"M. Mignotte, \"An Inequality about Factors of Polynomials,\" Mathematics of Computation, Vol. 28, 1974, pp. 1153\u20131157.","journal-title":"Mathematics of Computation"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"M. Mignotte, \"Some Inequalities About Univariate Polynomials,\" Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation, Snowbird, Utah, August 5\u20137, 1981, pp. 195\u2013199.","DOI":"10.1145\/800206.806395"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"P. M. A. Moore and A. C. Norman, \"Implementing a polynomial factorization and GCD package,\" Proceedings, ACM Symposium on Symbolic and Algebraic Computation, August 1981, pp. 109\u2013113.","DOI":"10.1145\/800206.806379"},{"issue":"6","key":"22_CR9","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1281-136","volume":"245","author":"R. Pavelle","year":"1981","unstructured":"R. Pavelle, M. Rothstein and J. Fitch, \"Computer Algebra,\" Scientific American, Vol 245 No. 6, December 1981, pp. 136\u2013152.","journal-title":"Scientific American"},{"key":"22_CR10","unstructured":"P. S. Wang, \"Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm,\" Proceedings, MACSYMA Users' Conference (1979), Cambridge, MA, MIT pp. 310\u2013318."},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1089292.1089293","volume":"16","author":"P. S. Wang","year":"1982","unstructured":"P. S. Wang, M. Guy, and J. Davenport, \"p-adic Reconstruction of Rational Numbers,\" ACM SIGSAM Bulletin, Vol. 16, May 1982, pp. 2\u20133.","journal-title":"ACM SIGSAM Bulletin"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"P. S. Wang, \"A p-adic Algorithm for Univariate Partial Fractions,\" Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation, Snowbird, Utah, August 5\u20137, 1981, pp. 212\u2013217.","DOI":"10.1145\/800206.806398"},{"key":"22_CR13","unstructured":"MACSYMA Reference Manual version nine, the MATHLAB group, Laboratory for Computer Science, MIT, Camb. MA. 02139"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12868-9_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:51:32Z","timestamp":1619556692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12868-9_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540128687","9783540387565"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-12868-9_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}