{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:10:30Z","timestamp":1776881430471,"version":"3.51.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030431198","type":"print"},{"value":"9783030431204","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_1","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"3-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Certified Hermite Matrices from Approximate Roots - Univariate Case"],"prefix":"10.1007","author":[{"given":"Tulay","family":"Ayyildiz Akoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnes","family":"Szanto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.jsc.2017.03.004","volume":"84","author":"T Ayyildiz Akoglu","year":"2018","unstructured":"Ayyildiz Akoglu, T., Hauenstein, J.D., Szanto, A.: Certifying solutions to overdetermined and singular polynomial systems over Q. J. Symb. Comput. 84, 147\u2013171 (2018)","journal-title":"J. Symb. Comput."},{"key":"1_CR2","unstructured":"Ayyildiz Akoglu, T.: Certifying solutions to polynomial systems over Q. Ph.D. thesis, North Carolina State University (2016)"},{"key":"1_CR3","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. AACIM, vol. 10. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-33099-2"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jsc.2017.03.009","volume":"86","author":"R Becker","year":"2018","unstructured":"Becker, R., Sagraloff, M., Sharma, V., Yap, C.: A near-optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration. J. Symb. Comput. 86, 51\u201396 (2018)","journal-title":"J. Symb. Comput."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-59175-3_100","volume-title":"LATIN \u201995: Theoretical Informatics","author":"L Gonz\u00e1lez-Vega","year":"1995","unstructured":"Gonz\u00e1lez-Vega, L.: On the complexity of computing the greatest common divisor of several univariate polynomials. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds.) LATIN 1995. LNCS, vol. 911, pp. 332\u2013345. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59175-3_100"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Numerically Solving Polynomial Systems with Bertini, vol. 25. SIAM, Philadelphia (2013)","DOI":"10.1137\/1.9781611972702"},{"key":"1_CR7","unstructured":"Hermite, C.: Sur le nombre des racines d\u2019une \u00e9quation alg\u00e9brique comprise entre des limites donn\u00e9es. J. Reine Angew. Math. 52, 39\u201351 (1850). Also in Oeuvres completes, vol. 1, pp. 397\u2013414"},{"issue":"52\u201354","key":"1_CR8","first-page":"171","volume":"36","author":"C Hermite","year":"1853","unstructured":"Hermite, C.: Remarques sur le th\u00e9or\u00e8me de Sturm. CR Acad. Sci. Paris 36(52\u201354), 171 (1853)","journal-title":"CR Acad. Sci. Paris"},{"key":"1_CR9","unstructured":"Hermite, C.: Extrait d\u2019une lettre de Mr. Ch. Hermite de Paris \u00e0 Mr. Borchardt de Berlin sur le nombre des racines d\u2019une \u00e9quation alg\u00e9brique comprises entre des limites donn\u00e9es. Journal f\u00fcr die reine und angewandte Mathematik 52, 39\u201351 (1856)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Pan, V.Y.: Nearly optimal polynomial root-finders: the state of the art and new progress. arXiv:1805.12042v10 [cs.NA] (2019)","DOI":"10.1007\/978-3-030-26831-2_26"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.tcs.2008.09.025","volume":"409","author":"H Peyrl","year":"2008","unstructured":"Peyrl, H., Parrilo, P.A.: Computing sum of squares decompositions with rational coefficients. Theoret. Comput. Sci. 409(2), 269\u2013281 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR12","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"issue":"3\/4","key":"1_CR13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/1940475.1940513","volume":"44","author":"DE Steffy","year":"2011","unstructured":"Steffy, D.E.: Exact solutions to linear systems of equations using output sensitive lifting. ACM Commun. Comput. Algebra 44(3\/4), 160\u2013182 (2011)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.jsc.2005.11.001","volume":"41","author":"Z Wan","year":"2006","unstructured":"Wan, Z.: An algorithm to solve integer linear systems exactly using numerical methods. J. Symb. Comput. 41, 621\u2013632 (2006)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/S0097539702408636","volume":"32","author":"X Wang","year":"2003","unstructured":"Wang, X., Pan, V.Y.: Acceleration of Euclidean algorithm and rational number reconstruction. SIAM J. Comput. 32(2), 548\u2013556 (2003)","journal-title":"SIAM J. Comput."},{"key":"1_CR16","unstructured":"Weisstein, E.W.: Newton-Girard Formulas. From MathWorld-A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Newton-GirardFormulas.html"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T20:19:06Z","timestamp":1614889146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}