{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:53:55Z","timestamp":1776848035156,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T00:00:00Z","timestamp":1406505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CSTC","award":["cstc2013jjys0002"],"award-info":[{"award-number":["cstc2013jjys0002"]}]},{"name":"NKBRPC","award":["2011CB302400"],"award-info":[{"award-number":["2011CB302400"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91118001, 11170153"],"award-info":[{"award-number":["91118001, 11170153"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,28]]},"DOI":"10.1145\/2631948.2631965","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"88-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Two variants of HJLS-PSLQ with applications"],"prefix":"10.1145","author":[{"given":"Yong","family":"Feng","sequence":"first","affiliation":[{"name":"Chongqing Institute of Green and Intelligent Technology, CAS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwei","family":"Chen","sequence":"additional","affiliation":[{"name":"Chongqing Institute of Green and Intelligent Technology, CAS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Wu","sequence":"additional","affiliation":[{"name":"Chongqing Institute of Green and Intelligent Technology, CAS"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90031-4"},{"key":"e_1_3_2_1_2_1","first-page":"8","article-title":"PSLQ: An algorithm to discover integer relations","volume":"45","author":"Bailey D. H.","year":"2009","unstructured":"Bailey , D. H. , and Borwein , J. M . PSLQ: An algorithm to discover integer relations . Computeralgebra Rundbrief , 45 ( 2009 ), 8 -- 11 . Bailey, D. H., and Borwein, J. M. PSLQ: An algorithm to discover integer relations. Computeralgebra Rundbrief, 45 (2009), 8--11.","journal-title":"Computeralgebra Rundbrief"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-00-01278-3"},{"key":"e_1_3_2_1_4_1","volume-title":"Notes on Ferguson and Forcade's generalized euelidean algorithm","author":"Bergman G. M.","year":"1980","unstructured":"Bergman , G. M. Notes on Ferguson and Forcade's generalized euelidean algorithm . University of California at Berkeley , unpublished notes ( 1980 ). Available from: math.berkeley.edu\/~gbergman\/papers\/unpub\/FF_Euc.pdf. Bergman, G. M. Notes on Ferguson and Forcade's generalized euelidean algorithm. University of California at Berkeley, unpublished notes (1980). Available from: math.berkeley.edu\/~gbergman\/papers\/unpub\/FF_Euc.pdf."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00256-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21652-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465506.2465936"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576802.2576819"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-00995-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1979-14691-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608645"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"Golub G. H.","year":"2013","unstructured":"Golub , G. H. , and van Loan , C. Matrix Computations , 4 th ed. The John Hopkins University Press , Baltimore , 2013 . Golub, G. H., and van Loan, C. Matrix Computations, 4th ed. The John Hopkins University Press, Baltimore, 2013.","edition":"4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/22587.22596"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1993.395505"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795295626"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-314X(01)92763-5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12200-2_47"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 2nd Gauss Symposium","author":"Joux A.","year":"1993","unstructured":"Joux , A. A fast parallel lattice reduction algorithm . In Proceedings of the 2nd Gauss Symposium ( Munich, Germany , 1993 ). Available at www-polsys.lip6.fr\/~joux\/pages\/papers\/FastParallel.pdf. Joux, A. A fast parallel lattice reduction algorithm. In Proceedings of the 2nd Gauss Symposium (Munich, Germany, 1993). Available at www-polsys.lip6.fr\/~joux\/pages\/papers\/FastParallel.pdf."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808681"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_22_1","volume-title":"Integer Relation Algorithms and the Recognition of Numerical Constants. Master's thesis","author":"Meichsner A.","year":"2001","unstructured":"Meichsner , A. Integer Relation Algorithms and the Recognition of Numerical Constants. Master's thesis , Simon Fraser University , 2001 . Meichsner, A. Integer Relation Algorithms and the Recognition of Numerical Constants. Master's thesis, Simon Fraser University, 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576740"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/070705702"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993691"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1577190.1577211"},{"key":"e_1_3_2_1_27_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/3-540-55895-0_455","volume-title":"Parallel Processing: CONPAR 92--VAPP V","author":"Roch J.-L.","year":"1992","unstructured":"Roch , J.-L. , and Villard , G . Parallel gcd and lattice basis reduction . In Parallel Processing: CONPAR 92--VAPP V , L. Boug\u00e9, M. Cosnard, Y. Robert, and D. Trystram, Eds., vol. 634 of Lecture Notes in Computer Science . Springer , 1992 , pp. 557 -- 564 . Roch, J.-L., and Villard, G. Parallel gcd and lattice basis reduction. In Parallel Processing: CONPAR 92--VAPP V, L. Boug\u00e9, M. Cosnard, Y. Robert, and D. Trystram, Eds., vol. 634 of Lecture Notes in Computer Science. Springer, 1992, pp. 557--564."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/143242.143327"},{"key":"e_1_3_2_1_29_1","volume-title":"Sparse bivariate polynomial factorization. Science China Mathematics","author":"Wu W.","year":"2014","unstructured":"Wu , W. , Chen , J. , and Feng , Y . Sparse bivariate polynomial factorization. Science China Mathematics ( 2014 ). To appear. Wu, W., Chen, J., and Feng, Y. Sparse bivariate polynomial factorization. Science China Mathematics (2014). To appear."},{"key":"e_1_3_2_1_30_1","first-page":"9","article-title":"Obtaining exact value by approximate computations","volume":"50","author":"Zhang J.","year":"2007","unstructured":"Zhang , J. , and Feng , Y . Obtaining exact value by approximate computations . Science in China Series A: Mathematics 50 , 9 ( 2007 ), 1361--1368. Zhang, J., and Feng, Y. Obtaining exact value by approximate computations. Science in China Series A: Mathematics 50, 9 (2007), 1361--1368.","journal-title":"Science in China Series A: Mathematics"}],"event":{"name":"SNC '14: Symbolic-Numeric Computation 2014","location":"Shanghai China","acronym":"SNC '14","sponsor":["973 Program National Basic Research Program of China","KLMM Key Laboratory of Mathematics Mechanization","MapleSoft","ORCCA Ontario Research Centre for Computer Algebra","NSFC Natural Science Foundation of China","Chinese Academy of Engineering Chinese Academy of Engineering","NAG Numerical Algorithms Group","ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2014 Symposium on Symbolic-Numeric Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2631948.2631965","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2631948.2631965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:13Z","timestamp":1750231153000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2631948.2631965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,28]]},"references-count":29,"alternative-id":["10.1145\/2631948.2631965","10.1145\/2631948"],"URL":"https:\/\/doi.org\/10.1145\/2631948.2631965","relation":{},"subject":[],"published":{"date-parts":[[2014,7,28]]},"assertion":[{"value":"2014-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}