{"id":"https://openalex.org/W1535410253","doi":"https://doi.org/10.1145/1145768.1145786","title":"Almost tight recursion tree bounds for the Descartes method","display_name":"Almost tight recursion tree bounds for the Descartes method","publication_year":2006,"publication_date":"2006-07-09","ids":{"openalex":"https://openalex.org/W1535410253","doi":"https://doi.org/10.1145/1145768.1145786","mag":"1535410253"},"language":"en","primary_location":{"id":"doi:10.1145/1145768.1145786","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1145768.1145786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030438230","display_name":"Arno Eigenwillig","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"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Arno Eigenwillig","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102371227","display_name":"Vikram Sharma","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vikram Sharma","raw_affiliation_strings":["NYU, New York","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"NYU, New York","institution_ids":[]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078989577","display_name":"Chee Yap","orcid":"https://orcid.org/0000-0003-2952-3545"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chee K. Yap","raw_affiliation_strings":["NYU, New York"],"affiliations":[{"raw_affiliation_string":"NYU, New York","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030438230"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05263402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"71","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9932000041007996,"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.9932000041007996,"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/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9829999804496765,"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/recursion","display_name":"Recursion (computer science)","score":0.6363846659660339},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5048149228096008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49980759620666504},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4364092946052551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42865145206451416},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34278011322021484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2959851026535034}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6363846659660339},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5048149228096008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49980759620666504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4364092946052551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42865145206451416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34278011322021484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2959851026535034}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1145768.1145786","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1145768.1145786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.7463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.7463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://domino.mpi-inf.mpg.de/intranet/ag1/ag1publ.nsf/AuthorEditorIndividualView/6e09cb7fbe62ea64c12571b20040a5d4/$FILE/ESY-DescTree-ISSAC06-authprep.pdf?OpenElement","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:314542","is_oa":false,"landing_page_url":"http://edoc.mpg.de/314542","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM, 71-78 (2006)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1328265","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-21EB-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1535410253","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1328265","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1539205156","https://openalex.org/W1971946762","https://openalex.org/W1971967210","https://openalex.org/W2002413805","https://openalex.org/W2003860131","https://openalex.org/W2006311046","https://openalex.org/W2012500323","https://openalex.org/W2018946319","https://openalex.org/W2025810010","https://openalex.org/W2073209099","https://openalex.org/W2077961479","https://openalex.org/W2080952133","https://openalex.org/W2089446629","https://openalex.org/W2441241344","https://openalex.org/W4229859564","https://openalex.org/W6630178116","https://openalex.org/W6630387786","https://openalex.org/W6635834624","https://openalex.org/W6644879133"],"related_works":["https://openalex.org/W804974737","https://openalex.org/W424404148","https://openalex.org/W2612000084","https://openalex.org/W2379098066","https://openalex.org/W1520244229","https://openalex.org/W2053859260","https://openalex.org/W998177306","https://openalex.org/W2467957161","https://openalex.org/W2498413163","https://openalex.org/W85450016","https://openalex.org/W167110062","https://openalex.org/W90338445","https://openalex.org/W2921801007","https://openalex.org/W2584778959","https://openalex.org/W2507136610","https://openalex.org/W1538838225","https://openalex.org/W952432298","https://openalex.org/W2760959810","https://openalex.org/W822637909","https://openalex.org/W963953723"],"abstract_inverted_index":{"We":[0,44,93],"give":[1,46],"a":[2,47,81],"unified":[3],"(\"basis":[4],"free\")":[5],"framework":[6,20],"for":[7,11,29,61,100,116],"the":[8,22,32,41,51,54,58,88,110,117],"Descartes":[9,59],"method":[10,28,60],"real":[12,17,64],"root":[13],"isolation":[14],"of":[15,26,53,83,90],"square-free":[16],"polynomials.":[18],"This":[19],"encompasses":[21],"usual":[23],"Descartes'":[24],"rule":[25],"sign":[27],"polynomials":[30,62,68],"in":[31,40,57],"power":[33],"basis":[34],"as":[35,37],"well":[36],"its":[38],"analog":[39],"Bernstein":[42],"basis.":[43],"then":[45],"new":[48],"bound":[49,82,97,115],"on":[50,87],"size":[52,89],"recursion":[55,91],"tree":[56],"with":[63,73],"coefficients.":[65],"Applied":[66],"to":[67,108],"A(X)":[69],"=":[70,102],"\u0395ni=0":[71],"aiXi":[72],"integer":[74,118],"coefficients":[75],"|ai|":[76],"<":[77],"2L,":[78],"this":[79,96],"yields":[80],"O(n(L":[84],"+":[85],"logn))":[86],"trees.":[92],"show":[94],"that":[95],"is":[98],"tight":[99],"L":[101],"\u03a9(logn),":[103],"and":[104],"we":[105],"use":[106],"it":[107],"derive":[109],"best":[111],"known":[112],"bit":[113],"complexity":[114],"case.":[119]},"counts_by_year":[],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}