{"id":"https://openalex.org/W6929082779","doi":"https://doi.org/10.4230/lipics.fsttcs.2022.10","title":"On Solving Sparse Polynomial Factorization Related Problems","display_name":"On Solving Sparse Polynomial Factorization Related Problems","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6929082779","doi":"https://doi.org/10.4230/lipics.fsttcs.2022.10"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:17402","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.10","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bisht, Pranav","orcid":null},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bisht, Pranav","raw_affiliation_strings":["Computer Science Department, Boston College, Chestnut Hill, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston College, Chestnut Hill, MA, USA","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"last","author":{"id":null,"display_name":"Volkovich, Ilya","orcid":null},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Volkovich, Ilya","raw_affiliation_strings":["Computer Science Department, Boston College, Chestnut Hill, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston College, Chestnut Hill, MA, USA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I103531236"],"apc_list":null,"apc_paid":null,"fwci":0.0783,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4034521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10404","display_name":"Enzyme Catalysis and Immobilization","score":0.0885000005364418,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10404","display_name":"Enzyme Catalysis and Immobilization","score":0.0885000005364418,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10661","display_name":"biodegradable polymer synthesis and properties","score":0.0625,"subfield":{"id":"https://openalex.org/subfields/2502","display_name":"Biomaterials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12642","display_name":"Polymer-Based Agricultural Enhancements","score":0.04639999940991402,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5828999876976013},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5806000232696533},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5652999877929688},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.476500004529953},{"id":"https://openalex.org/keywords/factorization-of-polynomials","display_name":"Factorization of polynomials","score":0.460099995136261},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4361000061035156},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3901999890804291}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6687999963760376},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5828999876976013},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5806000232696533},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5652999877929688},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.476500004529953},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47049999237060547},{"id":"https://openalex.org/C108741685","wikidata":"https://www.wikidata.org/wiki/Q392477","display_name":"Factorization of polynomials","level":4,"score":0.460099995136261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40950000286102295},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C101525915","wikidata":"https://www.wikidata.org/wiki/Q7581979","display_name":"Square-free polynomial","level":4,"score":0.38179999589920044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.35429999232292175},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C45025165","wikidata":"https://www.wikidata.org/wiki/Q13424738","display_name":"Stable polynomial","level":5,"score":0.3239000141620636},{"id":"https://openalex.org/C2778355321","wikidata":"https://www.wikidata.org/wiki/Q17079427","display_name":"Identity (music)","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C25878781","wikidata":"https://www.wikidata.org/wiki/Q1473607","display_name":"Degree of a polynomial","level":3,"score":0.2937999963760376},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C126352355","wikidata":"https://www.wikidata.org/wiki/Q2562273","display_name":"Polynomial matrix","level":4,"score":0.2718000113964081},{"id":"https://openalex.org/C6077466","wikidata":"https://www.wikidata.org/wiki/Q5156597","display_name":"Complex quadratic polynomial","level":3,"score":0.2655999958515167}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:17402","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fsttcs.2022.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2022.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"pmh:oai:drops-oai.dagstuhl.de:17402","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,23,67,93],"a":[1,32,89,110],"recent":[2],"result":[3],"of":[4,31,103],"Bhargava,":[5],"Saraf":[6],"and":[7,39,107],"Volkovich":[8],"[FOCS\u201918;":[9],"JACM\u201920],":[10],"the":[11,58],"first":[12],"factor":[13,30],"sparsity":[14,60,91],"bound":[15,61],"for":[16,74,81,100],"constant":[17],"individual":[18,40],"degree":[19,41],"polynomials":[20],"was":[21,26],"shown.":[22],"particular,":[24,94],"it":[25],"shown":[27],"that":[28,57,84],"any":[29],"polynomial":[33,64,112],"with":[34],"at":[35,48],"most":[36,49],"s":[37],"terms":[38],"bounded":[42],"by":[43,77,88],"d":[44],"can":[45],"itself":[46],"have":[47],"s^O(d\u00b2log":[50],"n)":[51],"terms.":[52],"It":[53],"is":[54,113],"conjectured,":[55],"though,":[56],"\"true\"":[59],"should":[62],"be":[63,86],"(i.e.":[65],"s^poly(d)).":[66],"this":[68,75],"paper":[69],"we":[70,95],"provide":[71],"supporting":[72],"evidence":[73],"conjecture":[76],"presenting":[78],"polynomial-time":[79],"algorithms":[80,99,119],"several":[82],"problems":[83],"would":[85],"implied":[87],"polynomial-size":[90],"bound.":[92],"give":[96],"efficient":[97],"(deterministic)":[98],"identity":[101],"testing":[102,108],"\u03a3^[2]\u03a0\u03a3\u03a0^[ind-deg":[104],"d]":[105],"circuits":[106],"if":[109],"sparse":[111],"an":[114],"exact":[115],"power.":[116],"Hence,":[117],"our":[118],"rely":[120],"on":[121],"different":[122],"techniques.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}