{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:19Z","timestamp":1725456679402},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354013350X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032833","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:41:26Z","timestamp":1133430086000},"page":"86-99","source":"Crossref","is-referenced-by-count":2,"title":["Implementation of a p-adic package for polynomial factorization and other related operations"],"prefix":"10.1007","author":[{"given":"Paul S.","family":"Wang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_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":"Berlekamp, E. R.: Factoring Polynomials over Finite Fields. Bell System Tech. J., vol. 46, 1853\u20131859 (1967).","journal-title":"Bell System Tech. J."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E. R. Berlekamp","year":"1970","unstructured":"Berlekamp, E. R.: Factoring polynomials over large finite fields. Math. Comp., vol. 24, 713\u2013735 (1970).","journal-title":"Math. Comp."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Davenport, J.: Factorisation of sparse polynomials. Proceedings, ACM EUROSAM'83 Conference, Kingston Polytechnic, Kingston, England, Mar. 28\u201330 (1983).","DOI":"10.1007\/3-540-12868-9_105"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Foderaro, J. K., Fateman, R. J.: Characterization of VAX Macsyma. Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, 14\u201319.","DOI":"10.1145\/800206.806364"},{"key":"10_CR5","unstructured":"Foderaro, J. K., Sklower, K. L.: The FRANZ LISP manual, UNIX Programmer's Manual, vol. 2C, Dept. Electrical Eng. and Computer Science, University of California at Berkeley, 1981."},{"key":"10_CR6","unstructured":"Kaltofen, E.: Factorization of Polynomials. Computer Algebra-Symbolic and Algebraic Computation, Computing, Suppl. 4, Springer-Verlag, 95\u2013113 (1982)."},{"key":"10_CR7","volume-title":"The Art of Computer Programming, vol. 2:Seminumerical Algorithms","author":"D. E. Knuth","year":"1980","unstructured":"Knuth, D. E.: The Art of Computer Programming, vol. 2:Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, Mass., USA, 1980.","edition":"2nd ed."},{"key":"10_CR8","unstructured":"Mignotte, M.: Some Useful Bounds. Computer Algebra-Symbolic and Algebraic Computation, Computing, Suppl. 4, Springer-Verlag, 259\u2013263 (1982)."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Moore, P. M. A., Norman, A. C.: Implementing a Polynomial Factorization and GCD Package. Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, 109\u2013116.","DOI":"10.1145\/800206.806379"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Moses, J., Yun, D. Y. Y.: The EZGCD Algorithm. Proceedings, 1973 ACM National Conference, 159\u2013166.","DOI":"10.1145\/800192.805698"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/321879.321890","volume":"22","author":"D. R. Musser","year":"1976","unstructured":"Musser, D. R.: Multivariate Polynomial Factorization. JACM, vol. 22, 291\u2013308 (1976).","journal-title":"JACM"},{"issue":"144","key":"10_CR12","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1090\/S0025-5718-1978-0568284-3","volume":"32","author":"P. S. Wang","year":"1978","unstructured":"Wang, P. S.: An Improved Multivariate Polynomial Factoring Algorithm. Mathematics of Computation, vol. 32, No. 144, 1215\u20131231 (1978).","journal-title":"Mathematics of Computation"},{"issue":"3","key":"10_CR13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0208022","volume":"8","author":"P. S. Wang","year":"1979","unstructured":"Wang, P. S., Trager, B. M.: New Algorithms for Polynomial Square-free Decomposition over the Integers. SIAM J. Computing, vol. 8, No. 3, 300\u2013305 (1979).","journal-title":"SIAM J. Computing"},{"key":"10_CR14","unstructured":"Wang, P. S.: Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm. Proceedings, MACSYMA Users' Conference, Cambridge, MA, MIT 310\u2013318 (1979)."},{"issue":"2","key":"10_CR15","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1089220.1089228","volume":"14","author":"P. S. Wang","year":"1980","unstructured":"Wang, P. S.: The EEZ-GCD Algorithm. SIGSAM Bulletin, vol. 14, No. 2, 50\u201360 (1980).","journal-title":"SIGSAM Bulletin"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Wang, P. S.: A p-adic Algorithm for Univariate Partial Fractions. Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation, Snowbird, Utah, 212\u2013217.","DOI":"10.1145\/800206.806398"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1089292.1089293","volume":"16","author":"P. S. Wang","year":"1982","unstructured":"Wang, P. S., Guy, M., Davenport, J.: p-adic Reconstruction of Rational Numbers. ACM SIGSAM Bulletin, vol. 16, 2\u20133 (1982).","journal-title":"ACM SIGSAM Bulletin"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Wang, P. S.: Early Detection of True Factors in Univariate Polynomial Factorization. Proceedings, ACM EUROSAM '83, London, March 28\u201330, 1983, 225\u2013235.","DOI":"10.1007\/3-540-12868-9_106"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1090\/S0025-5718-1976-0568283-X","volume":"30","author":"P. S. Wang","year":"1976","unstructured":"Wang, P. S.: Factoring Multivariate Polynomials over Algebraic Number Fields. math. comp., vol. 30, 324\u2013336 (1976).","journal-title":"math. comp."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Zipple, R. E.: Newton's Iteration and the Sparse Hensel Algorithm. ACM SYMSAC, 68\u201372 (1981).","DOI":"10.1145\/800206.806372"}],"container-title":["Lecture Notes in Computer Science","EUROSAM 84"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:34:33Z","timestamp":1586594073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354013350X"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032833","relation":{},"subject":[]}}