{"id":"https://openalex.org/W7167237032","doi":"https://doi.org/10.48550/arxiv.2607.02364","title":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","display_name":"Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree","publication_year":2026,"publication_date":"2026-07-02","ids":{"openalex":"https://openalex.org/W7167237032","doi":"https://doi.org/10.48550/arxiv.2607.02364"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.02364","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02364","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.02364","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043767154","display_name":"Qiao-Long Huang","orcid":"https://orcid.org/0009-0001-1596-5863"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Qiao-Long","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140021128","display_name":"Yichuan Cao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cao, Yichuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139982838","display_name":"Ruichen Qiu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiu, Ruichen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103668258","display_name":"Gao X","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Xiao-Shan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9611999988555908,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9611999988555908,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.017000000923871994,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.005400000140070915,"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/degree","display_name":"Degree (music)","score":0.6876999735832214},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.680400013923645},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5268999934196472},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5164999961853027},{"id":"https://openalex.org/keywords/square-free-polynomial","display_name":"Square-free polynomial","score":0.4975000023841858},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49309998750686646},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49070000648498535},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4803999960422516},{"id":"https://openalex.org/keywords/factorization-of-polynomials","display_name":"Factorization of polynomials","score":0.4740999937057495}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7427999973297119},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6876999735832214},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.680400013923645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5374000072479248},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5268999934196472},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5164999961853027},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5030999779701233},{"id":"https://openalex.org/C101525915","wikidata":"https://www.wikidata.org/wiki/Q7581979","display_name":"Square-free polynomial","level":4,"score":0.4975000023841858},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49309998750686646},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4803999960422516},{"id":"https://openalex.org/C108741685","wikidata":"https://www.wikidata.org/wiki/Q392477","display_name":"Factorization of polynomials","level":4,"score":0.4740999937057495},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.41679999232292175},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C25878781","wikidata":"https://www.wikidata.org/wiki/Q1473607","display_name":"Degree of a polynomial","level":3,"score":0.39660000801086426},{"id":"https://openalex.org/C126352355","wikidata":"https://www.wikidata.org/wiki/Q2562273","display_name":"Polynomial matrix","level":4,"score":0.37610000371932983},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C194777461","wikidata":"https://www.wikidata.org/wiki/Q1085860","display_name":"Root-finding algorithm","level":3,"score":0.3587000072002411},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.3395000100135803},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C165030954","wikidata":"https://www.wikidata.org/wiki/Q1476663","display_name":"Irreducible polynomial","level":4,"score":0.3086000084877014},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29350000619888306},{"id":"https://openalex.org/C2780130068","wikidata":"https://www.wikidata.org/wiki/Q2208651","display_name":"Transversal (combinatorics)","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C97395012","wikidata":"https://www.wikidata.org/wiki/Q1422356","display_name":"Reciprocal polynomial","level":4,"score":0.2709999978542328},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2680000066757202}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.02364","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02364","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.02364","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02364","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,56],"study":[1],"the":[2,7,15,62,84,91,109,117,120,127,144,156,164,196,202],"problem":[3],"of":[4,10,44,52,96,146,152,166,172],"deterministically":[5],"computing":[6,167],"exact":[8,29],"root":[9,151,171],"a":[11,23,49,58,79,105,148,153,168,173,189,208],"sparse":[12],"polynomial":[13,25,64,197],"in":[14,116,155],"multivariate":[16],"setting.":[17],"Let":[18],"$f":[19,33],"\\in":[20],"\\F[x_1,\\ldots,x_n]$":[21],"be":[22],"nonzero":[24],"that":[26,82],"is":[27,38,114,124,130,178,193],"an":[28,41],"$e$-th":[30,150],"power,":[31],"say":[32],"=":[34,54],"g^e$.":[35],"Suppose":[36],"$f$":[37],"$s$-sparse,":[39],"has":[40],"individual":[42],"degree":[43,51,122],"at":[45],"most":[46],"$d$,":[47],"and":[48,99,180],"total":[50,121],"$D":[53],"\\tdeg(f)$.":[55],"prove":[57],"sparsity":[59],"bound":[60],"on":[61,74,108],"base":[63,85,157],"$g$:":[65],"\\[":[66,131],"\\|g\\|_0":[67],"\\le":[68],"s^{D(2d+2)/e":[69],"+":[70,136],"1}.":[71],"\\]":[72,139],"Based":[73],"this":[75,206],"bound,":[76],"we":[77],"develop":[78],"deterministic":[80,93,209],"algorithm":[81,95,113,211],"computes":[83],"$g$.":[86],"%":[87,140,175,200],"In":[88],"contrast":[89],"to":[90],"general":[92],"factorization":[94],"Bhargava,":[97],"Saraf,":[98],"Volkovich":[100],"\\cite{BhargavaSarafVolkovich2020},":[101],"which":[102],"achieves":[103],"only":[104],"quasi-polynomial":[106],"dependence":[107],"input":[110],"parameters,":[111],"our":[112],"\\emph{polynomial-time}":[115],"setting":[118],"where":[119,141],"$D$":[123],"bounded.":[125],"Specifically,":[126],"overall":[128],"complexity":[129,198],"\\mathrm{poly}\\left(s^{O(Dd)},":[132],"n,":[133],"d,":[134],"D\\right)":[135],"s\\cdot":[137],"R(e),":[138],"$R(e)$":[142],"denotes":[143],"cost":[145,165],"constructing":[147],"single":[149,169],"scalar":[154],"field":[158],"$\\F$,":[159],"and,":[160],"when":[161],"$\\operatorname{char}(\\F)\\mid":[162],"e$,":[163],"Frobenius":[170],"scalar.":[174],"This":[176],"term":[177],"field-dependent,":[179],"over":[181],"finite":[182],"fields,":[183],"$\\mathbb{Q}$,":[184],"or":[185],"number":[186],"fields":[187],"with":[188],"suitable":[190],"representation,":[191],"it":[192],"absorbed":[194],"into":[195],"bound.":[199],"Within":[201],"bounded":[203],"total-degree":[204],"regime,":[205],"yields":[207],"polynomial-time":[210],"for":[212],"exact-root":[213],"computation.":[214]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-04T00:00:00"}