{"id":"https://openalex.org/W2098207812","doi":"https://doi.org/10.1145/1806689.1806772","title":"Towards polynomial lower bounds for dynamic problems","display_name":"Towards polynomial lower bounds for dynamic problems","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2098207812","doi":"https://doi.org/10.1145/1806689.1806772","mag":"2098207812"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111909002","display_name":"Mihai P\u01cetra\u015fcu","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mihai Patrascu","raw_affiliation_strings":["AT&T Labs, Florham Park, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111909002"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":8.7664,"has_fulltext":false,"cited_by_count":216,"citation_normalized_percentile":{"value":0.98755385,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"603","last_page":"610"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/reduction","display_name":"Reduction (mathematics)","score":0.6322147250175476},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6109669804573059},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5989223718643188},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5713700652122498},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4936922490596771},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.48235076665878296},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47349247336387634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4690692126750946},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4545419216156006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44114065170288086},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.42152881622314453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4104652404785156},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3827791213989258},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31614989042282104}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6322147250175476},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6109669804573059},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5989223718643188},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5713700652122498},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4936922490596771},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.48235076665878296},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47349247336387634},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4690692126750946},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4545419216156006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44114065170288086},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.42152881622314453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4104652404785156},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3827791213989258},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31614989042282104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1806689.1806772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W15092079","https://openalex.org/W1530008367","https://openalex.org/W1546441687","https://openalex.org/W1554407673","https://openalex.org/W1963524245","https://openalex.org/W1969485351","https://openalex.org/W1982440947","https://openalex.org/W2011182146","https://openalex.org/W2012948111","https://openalex.org/W2038255135","https://openalex.org/W2049647076","https://openalex.org/W2051019379","https://openalex.org/W2053754355","https://openalex.org/W2058084873","https://openalex.org/W2080525033","https://openalex.org/W2091720561","https://openalex.org/W2099450374","https://openalex.org/W2107016113","https://openalex.org/W2132676992","https://openalex.org/W2139666321","https://openalex.org/W2150123893","https://openalex.org/W2165461157","https://openalex.org/W2229615128","https://openalex.org/W3139713485","https://openalex.org/W4213071546","https://openalex.org/W4256418102","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2039864950","https://openalex.org/W4288279572","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W4287023968","https://openalex.org/W1973978937","https://openalex.org/W4286909116"],"abstract_inverted_index":{"We":[0,33,63],"consider":[1],"a":[2,35,95,114],"number":[3],"of":[4,39,90],"dynamic":[5,37],"problems":[6],"with":[7],"no":[8],"known":[9],"poly-logarithmic":[10],"upper":[11],"bounds,":[12],"and":[13,45,78],"show":[14],"that":[15,47,101],"they":[16],"require":[17],"n\u03a9(1)":[18],"time":[19,51],"per":[20,52],"operation,":[21],"unless":[22],"3SUM":[23,65],"has":[24],"strongly":[25],"subquadratic":[26],"algorithms.":[27],"Our":[28],"result":[29],"is":[30,71,99],"modular:":[31],"(1)":[32],"describe":[34],"carefully-chosen":[36],"version":[38],"set":[40],"disjointness":[41],"(the":[42],"\"multiphase":[43],"problem\"),":[44],"conjecture":[46],"it":[48,87],"requires":[49],"n^Omega(1)":[50],"operation.":[53],"All":[54],"our":[55],"lower":[56,104],"bounds":[57],"follow":[58],"by":[59],"easy":[60],"reduction.":[61],"(2)":[62],"reduce":[64],"to":[66],"the":[67,72,107],"multiphase":[68,108],"problem.":[69],"Ours":[70],"first":[73],"nonalgebraic":[74],"reduction":[75],"from":[76],"3SUM,":[77],"allows":[79],"3SUM-hardness":[80],"results":[81],"for":[82,106],"combinatorial":[83],"problems.":[84],"For":[85],"instance,":[86],"implies":[88],"hardness":[89],"reporting":[91],"all":[92],"triangles":[93],"in":[94],"graph.":[96],"(3)":[97],"It":[98],"plausible":[100],"an":[102],"unconditional":[103],"bound":[105],"problem":[109],"can":[110],"be":[111],"established":[112],"via":[113],"number-on-forehead":[115],"communication":[116],"game.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":22},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}