{"id":"https://openalex.org/W7170152021","doi":"https://doi.org/10.4230/lipics.ccc.2026.20","title":"On Factorization of Sparse Polynomials of Bounded Individual Degree","display_name":"On Factorization of Sparse Polynomials of Bounded Individual Degree","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170152021","doi":"https://doi.org/10.4230/lipics.ccc.2026.20"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.20","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.20","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128652400","display_name":"Aminadav Chuyoon","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Chuyoon, Aminadav","raw_affiliation_strings":["School of Mathematics, Tel Aviv University, Israel"],"raw_orcid":"https://orcid.org/0009-0009-1326-0681","affiliations":[{"raw_affiliation_string":"School of Mathematics, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004182247","display_name":"Amir Shpilka","orcid":"https://orcid.org/0000-0003-2384-425X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shpilka, Amir","raw_affiliation_strings":["Blavatnik School of Computer Science and AI, Tel Aviv University, Israel"],"raw_orcid":"https://orcid.org/0000-0003-2384-425X","affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science and AI, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8086000084877014},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6262000203132629},{"id":"https://openalex.org/keywords/factorization-of-polynomials","display_name":"Factorization of polynomials","score":0.5685999989509583},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5087000131607056},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4867999851703644},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4717000126838684},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.3921000063419342}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8086000084877014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6783000230789185},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6262000203132629},{"id":"https://openalex.org/C108741685","wikidata":"https://www.wikidata.org/wiki/Q392477","display_name":"Factorization of polynomials","level":4,"score":0.5685999989509583},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5087000131607056},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4903999865055084},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4867999851703644},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.420199990272522},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34049999713897705},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C165030954","wikidata":"https://www.wikidata.org/wiki/Q1476663","display_name":"Irreducible polynomial","level":4,"score":0.29750001430511475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.20","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.20","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"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,251],"study":[1],"sparse":[2,33,37,175,190,211,216,232],"polynomials":[3,73,123,217],"with":[4,39,238],"bounded":[5,40,75,125,178,219],"individual":[6,41,76,126,179,220],"degree":[7,77,127],"and":[8,21,169,248,284,331,334],"the":[9,18,32,49,54,108,140,157,182,185,243,280,306],"class":[10,313],"of":[11,35,45,56,60,74,121,124,134,159,177,208,215,218,235,245,273,282,294,308,314,319,329,340],"their":[12,83,239],"factors.":[13],"In":[14,102,181],"particular":[15],"we":[16,47,192,222,304],"obtain":[17],"following":[19],"algorithmic":[20],"structural":[22],"results:":[23],"1)":[24],"A":[25,64],"deterministic":[26,225],"polynomial-time":[27,226],"algorithm":[28,67,109,141,158,195,227,281],"for":[29,68,117,228,311],"finding":[30,229],"all":[31,230],"divisors":[34,310],"a":[36,93,119,173,188,206,224,259,262,271,312],"polynomial":[38,112,176],"degree.":[42,180],"As":[43],"part":[44],"this,":[46],"establish":[48],"first":[50],"upper":[51],"bound":[52],"on":[53],"number":[55],"non-monomial":[57],"irreducible":[58,71,231],"factors":[59,214,234],"such":[61,258],"polynomials.":[62],"2)":[63],"poly(n,s^{dlog":[65],"\ud835\udcc1})-time":[66],"recovering":[69],"\ud835\udcc1":[70,105],"s-sparse":[72,122],"d":[78,128],"from":[79,129,338],"blackbox":[80,130,203],"access":[81,204],"to":[82,172,205,255,326],"product":[84,120,207,260],"(which":[85],"is":[86,187,261,268],"not":[87],"necessarily":[88,210],"sparse).":[89],"This":[90,154,241,322],"partially":[91],"resolves":[92],"question":[94],"posed":[95],"in":[96,111,143,151,166,198],"[Pranjal":[97],"Dutta":[98],"et":[99,161],"al.,":[100,162],"2024].":[101],"particular,":[103],"when":[104],"=":[106],"O(1),":[107],"runs":[110,142,150,165,197],"time.":[113],"3)":[114],"Deterministic":[115],"algorithms":[116,244,288],"factoring":[118],"access.":[131],"Over":[132],"fields":[133,148,293],"characteristic":[135,336],"zero":[136,274,295],"or":[137,212,275,296],"sufficiently":[138,297],"large,":[139],"poly(n,s^{d\u00b3log":[144],"n})-time;":[145],"over":[146,270,292],"arbitrary":[147,302],"it":[149,236,267],"poly(n,{(d\u00b2)!},s^{d\u2075log":[152],"n})-time.":[153,200],"improves":[155],"upon":[156],"[Bhargava":[160],"2020],":[163],"which":[164,316],"poly(n,s^{d\u2077log":[167],"n})-time":[168],"applies":[170],"only":[171],"single":[174,189],"case":[183,266],"where":[184],"input":[186],"polynomial,":[191],"give":[193,223],"an":[194],"that":[196],"poly(n,s^{d\u00b2log":[199],"4)":[201],"Given":[202],"(not":[209],"irreducible)":[213],"degree,":[221],"multiquadratic":[233],"(along":[237],"multiplicities).":[240],"generalizes":[242],"[Volkovich,":[246,249],"2015]":[247],"2017].":[250],"also":[252],"show":[253],"how":[254],"decide":[256],"whether":[257],"complete":[263],"power":[264],"(in":[265],"defined":[269],"field":[272],"large":[276,298],"enough":[277],"characteristic),":[278],"extending":[279],"[Bisht":[283,330],"Volkovich,":[285,332],"2025].":[286],"Our":[287],"most":[289,339],"naturally":[290],"apply":[291],"characteristic.":[299],"To":[300],"handle":[301],"fields,":[303],"introduce":[305],"notion":[307,323],"primitive":[309],"polynomials,":[315],"may":[317],"be":[318],"independent":[320],"interest.":[321],"enables":[324],"us":[325],"adapt":[327],"ideas":[328],"2025]":[333],"remove":[335],"assumptions":[337],"our":[341],"algorithms.":[342]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}