{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:27:13Z","timestamp":1758709633243,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3208976.3208991","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"167-174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Certification of Minimal Approximant Bases"],"prefix":"10.1145","author":[{"given":"Pascal","family":"Giorgi","sequence":"first","affiliation":[{"name":"LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Neiger","sequence":"additional","affiliation":[{"name":"Univ. Limoges, CNRS, XLIM, UMR 7252, Limoges, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230031"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(96)00120-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309929"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391992"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608644"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930908"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087609"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Theorie der einfachen Ungleichungen","volume":"124","author":"Farkas Julius","year":"1902","unstructured":"Julius Farkas . 1902 . Theorie der einfachen Ungleichungen . J. Reine Angew. Math. Vol. 124 (1902), 1 -- 27 . http:\/\/eudml.org\/doc\/149129 Julius Farkas. 1902. Theorie der einfachen Ungleichungen. J. Reine Angew. Math. Vol. 124 (1902), 1--27. http:\/\/eudml.org\/doc\/149129","journal-title":"J. Reine Angew. Math."},{"volume-title":"Mathematical Foundations of Computer Science","author":"Freivalds R.","key":"e_1_3_2_1_11_1","unstructured":"R. Freivalds . 1979. Fast probabilistic algorithms . In Mathematical Foundations of Computer Science , Vol. Vol. 74 . Springer Berlin Heidelberg , 57--69. R. Freivalds. 1979. Fast probabilistic algorithms. In Mathematical Foundations of Computer Science, Vol. Vol. 74. Springer Berlin Heidelberg, 57--69."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J. von zur Gathen and J. Gerhard. 2013. Modern Computer Algebra (third edition). Cambridge University Press.   J. von zur Gathen and J. Gerhard. 2013. Modern Computer Algebra (third edition). Cambridge University Press.","DOI":"10.1017\/CBO9781139856065"},{"key":"e_1_3_2_1_13_1","volume-title":"Certification of Polynomial Middle Product. (2017).","author":"Giorgi P.","year":"2018","unstructured":"P. Giorgi . 2017. Certification of Polynomial Middle Product. (2017). Available at https:\/\/hal-lirmm.ccsd.cnrs.fr\/lirmm-015384532 (accessed in May 2018 ). P. Giorgi. 2017. Certification of Polynomial Middle Product. (2017). Available at https:\/\/hal-lirmm.ccsd.cnrs.fr\/lirmm-015384532 (accessed in May 2018)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860889"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930928"},{"volume-title":"Linear Systems","author":"Kailath T.","key":"e_1_3_2_1_16_1","unstructured":"T. Kailath . 1980. Linear Systems . Prentice-Hall . T. Kailath. 1980. Linear Systems. Prentice-Hall."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.08.002"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993915"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90224-W"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"T. Kleinjung C. Diem A. K. Lenstra C. Priplata and C. Stahlke. 2017. Computation of a 768-Bit Prime Field Discrete Logarithm Eurocrypt 2017. Springer International Publishing 185--201.  T. Kleinjung C. Diem A. K. Lenstra C. Priplata and C. Stahlke. 2017. Computation of a 768-Bit Prime Field Discrete Logarithm Eurocrypt 2017. Springer International Publishing 185--201.","DOI":"10.1007\/978-3-319-56620-7_7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. 1995. Randomized Algorithms. Cambridge University Press New York NY USA.   R. Motwani and P. Raghavan. 1995. Randomized Algorithms. Cambridge University Press New York NY USA.","DOI":"10.1017\/CBO9780511814075"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00139-6"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_26_1","volume-title":"Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings).","author":"Storjohann A.","year":"2006","unstructured":"A. Storjohann . 2006 . Notes on computing minimal approximant bases . In Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings). A. Storjohann. 2006. Notes on computing minimal approximant bases. In Challenges in Symbolic Computation Software (Dagstuhl Seminar Proceedings)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02141952"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.009"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465506.2465947"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608640"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442881"},{"volume-title":"EUROSAM'79 (LNCS)","author":"Zippel R.","key":"e_1_3_2_1_32_1","unstructured":"R. Zippel . 1979. Probabilistic algorithms for sparse polynomials . In EUROSAM'79 (LNCS) , Vol. Vol. 72 . Springer , 216--226. R. Zippel. 1979. Probabilistic algorithms for sparse polynomials. In EUROSAM'79 (LNCS), Vol. Vol. 72. Springer, 216--226."}],"event":{"name":"ISSAC '18: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"New York NY USA","acronym":"ISSAC '18"},"container-title":["Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3208991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3208976.3208991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:49Z","timestamp":1750208929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208976.3208991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":31,"alternative-id":["10.1145\/3208976.3208991","10.1145\/3208976"],"URL":"https:\/\/doi.org\/10.1145\/3208976.3208991","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}