{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:43:21Z","timestamp":1649000601938},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,8,28]],"date-time":"2014-08-28T00:00:00Z","timestamp":1409184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s11424-014-2170-5","type":"journal-article","created":{"date-parts":[[2014,8,27]],"date-time":"2014-08-27T16:46:54Z","timestamp":1409158014000},"page":"243-260","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact bivariate polynomial factorization over \u211a by approximation of roots"],"prefix":"10.1007","volume":"28","author":[{"given":"Yong","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,28]]},"reference":[{"issue":"3","key":"2170_CR1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-314X(69)90047-X","volume":"1","author":"H Zassenhaus","year":"1969","unstructured":"Zassenhaus H, On hensel factorization, I, Journal of Number Theory, 1969, 1(3): 291\u2013311.","journal-title":"Journal of Number Theory"},{"issue":"141","key":"2170_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1090\/S0025-5718-1978-0476692-4","volume":"32","author":"H Zassenhaus","year":"1978","unstructured":"Zassenhaus H, A remark on the hensel factorization method, Mathematics of Computation, 1978, 32(141): 287\u2013292.","journal-title":"Mathematics of Computation"},{"issue":"2","key":"2170_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(85)90043-1","volume":"31","author":"J Gathen von zur","year":"1985","unstructured":"von zur Gathen J, Irreducibility of multivariate polynomials, Journal of Computer and System Sciences, 1985, 31(2): 225\u2013264.","journal-title":"Journal of Computer and System Sciences"},{"key":"2170_CR4","volume-title":"Modern Computer Algebra","author":"J Gathen von zur","year":"2003","unstructured":"von zur Gathen J and Gerhard J, Modern Computer Algebra, 2nd edition, Cambridge University Press, London, 2003.","edition":"2nd edition"},{"issue":"254","key":"2170_CR5","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1090\/S0025-5718-06-01810-2","volume":"75","author":"G Lecerf","year":"2006","unstructured":"Lecerf G, Sharp precision in Hensel lifting for bivariate polynomial factorization, Mathematics of Computation, 2006, 75(254): 921\u2013934.","journal-title":"Mathematics of Computation"},{"issue":"4","key":"2170_CR6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.jsc.2007.01.003","volume":"42","author":"G Lecerf","year":"2007","unstructured":"Lecerf G, Improved dense multivariate polynomial factorization algorithms, Journal of Symbolic Computation, 2007, 42(4): 477\u2013494.","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"2170_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00200-008-0062-4","volume":"19","author":"G Lecerf","year":"2008","unstructured":"Lecerf G, Fast separable factorization and applications, Applicable Algebra in Engineering, Communication and Computing, 2008, 19(2): 135\u2013160.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"2","key":"2170_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00200-010-0121-5","volume":"21","author":"G Lecerf","year":"2010","unstructured":"Lecerf G, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Applicable Algebra in Engineering, Communication and Computing, 2010, 21(2): 151\u2013176.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"279","key":"2170_CR9","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1090\/S0025-5718-2011-02562-7","volume":"81","author":"J Berthomieu","year":"2012","unstructured":"Berthomieu J and Lecerf G, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Mathematics of Computation, 2012, 81(279): 1799\u20131821.","journal-title":"Mathematics of Computation"},{"key":"2170_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.jsc.2013.05.011","volume":"58","author":"M Weimann","year":"2013","unstructured":"Weimann M, Factoring bivariate polynomials using adjoints, Journal of Symbolic Computation, 2013, 58: 77\u201398.","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"2170_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.jsc.2007.10.011","volume":"43","author":"F Abu Salem","year":"2008","unstructured":"Abu Salem F, An efficient sparse adaptation of the polytope method over $\\mathbb{F}_p $ and a record-high binary bivariate factorisation, Journal of Symbolic Computation, 2008, 43(5): 311\u2013341.","journal-title":"Journal of Symbolic Computation"},{"issue":"6","key":"2170_CR12","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.jco.2010.06.005","volume":"26","author":"M Weimann","year":"2010","unstructured":"Weimann M, A lifting and recombination algorithm for rational factorization of sparse polynomials, Journal of Complexity, 2010, 26(6): 608\u2013628.","journal-title":"Journal of Complexity"},{"key":"2170_CR13","first-page":"141","volume-title":"Proceedings of the 2013 international symposium on Symbolic and Algebraic Computation, Boston, USA","author":"A Chattopadhyay","year":"2013","unstructured":"Chattopadhyay A, Grenet B, Koiran P, Portier N, and Strozecki Y, Factoring bivariate lacunary polynomials without heights, in Proceedings of the 2013 international symposium on Symbolic and Algebraic Computation, Boston, USA, 2013, 141\u2013148."},{"key":"2170_CR14","doi-asserted-by":"crossref","unstructured":"Wu W, Chen J, and Feng Y, Sparse bivariate polynomial factorization, Science China Mathematics, 2014, 57, doi: 10.1007\/s11425-014-4850-y.","DOI":"10.1007\/s11425-014-4850-y"},{"key":"2170_CR15","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-51084-2_44","volume":"358","author":"E Kaltofen","year":"1989","unstructured":"Kaltofen E and Yagati L, Improved sparse multivariate polynomial interpolation algorithms, in Gianni P, editor, Symbolic and Algebraic Computation, Lecture Notes in Computer Science, Springer, 1989, 358: 467\u2013474.","journal-title":"Symbolic and Algebraic Computation"},{"issue":"2","key":"2170_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0165-1684(88)90002-3","volume":"14","author":"Z Mou-Yan","year":"1988","unstructured":"Mou-Yan Z and Unbehauen R, Approximate factorization of multivariable polynomials, Signal Processing, 1988, 14(2): 141\u2013152.","journal-title":"Signal Processing"},{"key":"2170_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/345542.345616","volume-title":"Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, St. Andrews, Scotland","author":"Y Huang","year":"2000","unstructured":"Huang Y, Wu W, Stetter H J, and Zhi L, Pseudofactors of multivariate polynomials, in Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, St. Andrews, Scotland, 2000, 161\u2013168."},{"issue":"3","key":"2170_CR18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF03167142","volume":"8","author":"T Sasaki","year":"1991","unstructured":"Sasaki T, Suzuki M, Kol\u2032a\u0159 M, and Sasaki M, Approximate factorization of multivariate polynomials and absolute irreducibility testing, Japan Journal of Industrial and Applied Mathematics, 1991, 8(3): 357\u2013375.","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"issue":"3","key":"2170_CR19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF03167271","volume":"9","author":"T Sasaki","year":"1992","unstructured":"Sasaki T, Saito T, and Hilano T, Analysis of approximate factorization algorithm I, Japan Journal of Industrial and Applied Mathematics, 1992, 9(3): 351\u2013368.","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"key":"2170_CR20","doi-asserted-by":"crossref","unstructured":"Sasaki T, Approximate multivariate polynomial factorization based on zero-sum relations, in Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, London, Canada, 2001, 284\u2013291.","DOI":"10.1145\/384101.384139"},{"key":"2170_CR21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/384101.384114","volume-title":"Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, London, Canada","author":"R M Corless","year":"2001","unstructured":"Corless R M, Giesbrecht MW, van Hoeij M, Kotsireas I, and Watt S M, Towards factoring bivariate approximate polynomials, in Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, London, Canada, 2001, 85\u201392."},{"issue":"2\u20133","key":"2170_CR22","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.tcs.2004.01.011","volume":"315","author":"A J Sommese","year":"2004","unstructured":"Sommese A J, Verschelde J, and Wampler C W, Numerical factorization of multivariate complex polynomials, Theoretical Computer Science, 2004, 315(2\u20133): 651\u2013669.","journal-title":"Theoretical Computer Science"},{"key":"2170_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1145\/1005285.1005311","volume-title":"Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, Santander, Spain","author":"S Gao","year":"2004","unstructured":"Gao S, Kaltofen E, May J P, Yang Z, and Zhi L, Approximate factorization of multivariate polynomials via differential equations, in Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, Santander, Spain, 2004, 167\u2013174."},{"issue":"5","key":"2170_CR24","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.jsc.2007.11.005","volume":"43","author":"E Kaltofen","year":"2008","unstructured":"Kaltofen E, May J P, Yang Z, and Zhi L, Approximate factorization of multivariate polynomials using singular value decomposition, Journal of Symbolic Computation, 2008, 43(5): 359\u2013376.","journal-title":"Journal of Symbolic Computation"},{"issue":"242","key":"2170_CR25","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1090\/S0025-5718-02-01428-X","volume":"72","author":"S Gao","year":"2003","unstructured":"Gao S, Factoring multivariate polynomials via partial differential equations, Mathematics of Computation, 2003, 72(242): 801\u2013822.","journal-title":"Mathematics of Computation"},{"issue":"5","key":"2170_CR26","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0747-7171(02)00011-1","volume":"37","author":"D Rupprecht","year":"2004","unstructured":"Rupprecht D, Semi-numerical absolute factorization of polynomials with integer coefficients, Journal of Symbolic Computation, 2004, 37(5): 557\u2013574.","journal-title":"Journal of Symbolic Computation"},{"issue":"6","key":"2170_CR27","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.jsc.2005.11.004","volume":"41","author":"G Ch\u2032eze","year":"2006","unstructured":"Ch\u2032eze G and Galligo A, From an approximate to an exact absolute polynomial factorization, Journal of Symbolic Computation, 2006, 41(6): 682\u2013696.","journal-title":"Journal of Symbolic Computation"},{"issue":"181","key":"2170_CR28","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1988-0917831-4","volume":"50","author":"R Kannan","year":"1988","unstructured":"Kannan R, Lenstra A K, and Lov\u2032asz L, Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers, Mathematics of Computation, 1988, 50(181): 235\u2013250.","journal-title":"Mathematics of Computation"},{"issue":"9","key":"2170_CR29","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1007\/s11425-007-0092-6","volume":"50","author":"J Zhang","year":"2007","unstructured":"Zhang J and Feng Y, Obtaining exact value by approximate computations, Science in China Series A, Mathematics, 2007, 50(9): 1361\u20131368.","journal-title":"Science in China Series A, Mathematics"},{"issue":"17","key":"2170_CR30","doi-asserted-by":"crossref","first-page":"2333","DOI":"10.1080\/00207160.2012.716199","volume":"89","author":"X Qin","year":"2012","unstructured":"Qin X, Feng Y, Chen J, and Zhang J, A complete algorithm to find exact minimal polynomial by approximations, International Journal of Computer Mathematics, 2012, 89(17): 2333\u20132344.","journal-title":"International Journal of Computer Mathematics"},{"key":"2170_CR31","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/3-540-15984-3_246","volume":"204","author":"M-P Hulst van der","year":"1985","unstructured":"van der Hulst M-P and Lenstra A K, Factorization of polynomials by transcendental evaluation, in Caviness B F, editor, EUROCAL\u2019 85, Lecture Notes in Computer Science, 1985, 204: 138\u2013145.","journal-title":"EUROCAL\u2019 85, Lecture Notes in Computer Science"},{"key":"2170_CR32","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/1577190.1577199","volume-title":"Proceedings of the 2009 Conference on Symbolic Numeric Computation, Kyoto, Japan","author":"J Chen","year":"2009","unstructured":"Chen J, Feng Y, Qin X, and Zhang J, Exact polynomial factorization by approximate high degree algebraic numbers, Proceedings of the 2009 Conference on Symbolic Numeric Computation, Kyoto, Japan, 2009, 21\u201328."},{"issue":"2\u20133","key":"2170_CR33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s00607-008-0015-6","volume":"83","author":"T L Lee","year":"2008","unstructured":"Lee T L, Li T Y, and Tsai C H, HOM4PS-2.0, a software package for solving polynomial systems by the polyhedral homotopy continuation method, Computing, 2008, 83(2\u20133): 109\u2013133.","journal-title":"Computing"},{"key":"2170_CR34","volume-title":"Bertini, Software for numerical algebraic geometry","author":"D J Bates","year":"2014","unstructured":"Bates D J, Hauenstein J D, Sommese A J, and Wampler C W, Bertini, Software for numerical algebraic geometry, Available at https:\/\/bertini.nd.edu\/ , June 2014."},{"issue":"2","key":"2170_CR35","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/317275.317286","volume":"25","author":"J Verschelde","year":"1999","unstructured":"Verschelde J, Algorithm 795, PHCpack, A general-purpose solver for polynomial systems by homotopy continuation, ACM Transactions on Mathematical Software, 1999, 25(2): 251\u2013276.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"2170_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L Blum","year":"1998","unstructured":"Blum L, Cucker F, Shub M, and Smale S, Complexity and Real Computation, Springer, New York, 1998."},{"issue":"2","key":"2170_CR37","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11075-005-9007-1","volume":"41","author":"S Ilie","year":"2006","unstructured":"Ilie S, Corless R M, and Reid G, Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time, Numerical Algorithms, 2006, 41(2): 161\u2013171.","journal-title":"Numerical Algorithms"},{"issue":"2","key":"2170_CR38","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0096-3003(87)90063-4","volume":"24","author":"A Morgan","year":"1987","unstructured":"Morgan A and Sommese A J, A homotopy for solving general polynomial systems that respects m-homogeneous structures, Applied Mathematics and Computation, 1987, 24(2): 101\u2013113.","journal-title":"Applied Mathematics and Computation"},{"key":"2170_CR39","doi-asserted-by":"crossref","DOI":"10.1142\/5763","volume-title":"The Numerical Solution of Systems of Polynomials Arising in Engineering and Science","author":"A J Sommese","year":"2005","unstructured":"Sommese A J and Wampler C W, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science, World Scientific, Singapore, 2005."},{"issue":"3","key":"2170_CR40","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0022-314X(74)90015-8","volume":"6","author":"M Fried","year":"1974","unstructured":"Fried M, On Hilbert\u2019s rrreducibility theorem, Journal of Number Theory, 1974, 6(3): 211\u2013231.","journal-title":"Journal of Number Theory"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2170-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-014-2170-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2170-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:07Z","timestamp":1559400847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-014-2170-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,28]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["2170"],"URL":"https:\/\/doi.org\/10.1007\/s11424-014-2170-5","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,28]]}}}