{"id":"https://openalex.org/W2345615338","doi":"https://doi.org/10.1145/2930889.2930937","title":"Computing Real Roots of Real Polynomials ... and now For Real!","display_name":"Computing Real Roots of Real Polynomials ... and now For Real!","publication_year":2016,"publication_date":"2016-07-19","ids":{"openalex":"https://openalex.org/W2345615338","doi":"https://doi.org/10.1145/2930889.2930937","mag":"2345615338"},"language":"en","primary_location":{"id":"doi:10.1145/2930889.2930937","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2930889.2930937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1605.00410","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alexander Kobel","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Kobel","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Fabrice Rouillier","orcid":null},"institutions":[{"id":"https://openalex.org/I3017942884","display_name":"Institut de Math\u00e9matiques de Jussieu-Paris Rive Gauche","ror":"https://ror.org/03fk87k11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I3017942884","https://openalex.org/I39804081","https://openalex.org/I4210141950"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fabrice Rouillier","raw_affiliation_strings":["INRIA Paris &amp; Universit\u00e9 Pierre et Marie Curie Paris VI &amp; Institut de Math\u00e9matiques de Jussieu Paris Rive Gauche, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Paris &amp; Universit\u00e9 Pierre et Marie Curie Paris VI &amp; Institut de Math\u00e9matiques de Jussieu Paris Rive Gauche, Paris, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I3017942884"]}]},{"author_position":"last","author":{"id":null,"display_name":"Michael Sagraloff","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Sagraloff","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6045,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.93173941,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"303","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9628999829292297,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9544000029563904,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.586899995803833},{"id":"https://openalex.org/keywords/root-finding-algorithm","display_name":"Root-finding algorithm","score":0.5701000094413757},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5680999755859375},{"id":"https://openalex.org/keywords/univariate","display_name":"Univariate","score":0.548799991607666},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5418000221252441},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.5317999720573425},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.4869000017642975},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4587000012397766},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4433000087738037}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5929999947547913},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.586899995803833},{"id":"https://openalex.org/C194777461","wikidata":"https://www.wikidata.org/wiki/Q1085860","display_name":"Root-finding algorithm","level":3,"score":0.5701000094413757},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5680999755859375},{"id":"https://openalex.org/C199163554","wikidata":"https://www.wikidata.org/wiki/Q1681619","display_name":"Univariate","level":3,"score":0.548799991607666},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5418000221252441},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.5317999720573425},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4587000012397766},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4433000087738037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41280001401901245},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36039999127388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3582000136375427},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29989999532699585},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.28349998593330383},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C1911482","wikidata":"https://www.wikidata.org/wiki/Q854531","display_name":"Real analysis","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.2639999985694885},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.26159998774528503},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C94020503","wikidata":"https://www.wikidata.org/wiki/Q12916","display_name":"Real number","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2930889.2930937","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2930889.2930937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1605.00410","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1605.00410","pdf_url":"https://arxiv.org/pdf/1605.00410","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01363955v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01363955","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSAC '16 Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.7, &#x27E8;10.1145/2930889.2930937&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1605.00410","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1605.00410","pdf_url":"https://arxiv.org/pdf/1605.00410","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W74955198","https://openalex.org/W1577339277","https://openalex.org/W1983396187","https://openalex.org/W1990397880","https://openalex.org/W1990564835","https://openalex.org/W1993041502","https://openalex.org/W1997509004","https://openalex.org/W2012048344","https://openalex.org/W2073158267","https://openalex.org/W2077961479","https://openalex.org/W2107996047","https://openalex.org/W2112074285","https://openalex.org/W2134534233","https://openalex.org/W2144619406","https://openalex.org/W2158622794","https://openalex.org/W2441241344","https://openalex.org/W2963548828","https://openalex.org/W6840977204"],"related_works":[],"abstract_inverted_index":{"Very":[0],"recent":[1],"work":[2],"introduces":[3],"an":[4,97],"asymptotically":[5],"fast":[6],"subdivision":[7,84],"algorithm,":[8],"denoted":[9],"ANewDsc,":[10],"for":[11,31,62,72],"isolating":[12],"the":[13,32,51,59,63,67,80,90,104,115,123,147,151],"real":[14,19,125],"roots":[15,76],"of":[16,26,34,44,69,82,99,103,114,150],"a":[17,110,142],"univariate":[18],"polynomial.":[20],"The":[21],"method":[22,71,118],"combines":[23],"Descartes?":[24],"Rule":[25],"Signs":[27],"to":[28,38,49,141],"test":[29],"intervals":[30],"existence":[33],"roots,":[35,45],"Newton":[36],"iteration":[37],"speed":[39],"up":[40],"convergence":[41],"against":[42],"clusters":[43],"and":[46,77,119,137],"approximate":[47],"computation":[48],"decrease":[50],"required":[52],"precision.":[53],"It":[54],"achieves":[55],"record":[56],"bounds":[57],"on":[58,96,101],"worst-case":[60],"complexity":[61,68,81,149],"considered":[64],"problem,":[65],"matching":[66],"Pan's":[70],"computing":[73],"all":[74],"complex":[75],"improving":[78],"upon":[79],"other":[83],"methods":[85],"by":[86],"several":[87],"magnitudes.":[88],"In":[89],"article":[91],"at":[92],"hand,":[93],"we":[94],"report":[95],"implementation":[98,144],"ANewDsc":[100,136],"top":[102],"RS":[105,108,138],"root":[106,126],"isolator.":[107],"is":[109],"highly":[111],"efficient":[112],"realization":[113],"classical":[116],"Descartes":[117],"currently":[120],"serves":[121],"as":[122],"default":[124],"solver":[127],"in":[128],"Maple.":[129],"We":[130],"describe":[131],"crucial":[132],"design":[133],"changes":[134],"within":[135],"that":[139],"led":[140],"high-performance":[143],"without":[145],"harming":[146],"theoretical":[148],"underlying":[152],"algorithm.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}
