{"id":"https://openalex.org/W4313227199","doi":"https://doi.org/10.1109/focs54457.2022.00059","title":"A tight (non-combinatorial) conditional lower bound for Klee\u2019s Measure Problem in 3D","display_name":"A tight (non-combinatorial) conditional lower bound for Klee\u2019s Measure Problem in 3D","alternate_titles":[],"publication_year":2022,"publication_date":"2022-10-01","ids":{"openalex":"https://openalex.org/W4313227199","doi":"https://doi.org/10.1109/focs54457.2022.00059"},"language":"en","primary_location":{"id":"doi:10.1109/focs54457.2022.00059","doi":"https://doi.org/10.1109/focs54457.2022.00059","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs54457.2022.00059","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4313227199"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5088790846","display_name":"Marvin K\u00fcnnemann","orcid":"https://orcid.org/0000-0003-4813-4852","observed_orcids":["https://orcid.org/0000-0003-4813-4852"]},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046","https://openalex.org/I4387152675"]}],"countries":["DE"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Marvin Kunnemann","raw_affiliation_strings":["TU Kaiserslautern,Kaiserslautern,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Kaiserslautern,Kaiserslautern,Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088790846"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":2.0287,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86045549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"555","last_page":"566"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8935999870300293,"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.8935999870300293,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.08940000087022781,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.00930000003427267,"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/axis-parallel-boxes","display_name":"axis-parallel boxes","score":0.7089999914169312},{"id":"https://openalex.org/keywords/conditional-lower-bounds","display_name":"conditional lower bounds","score":0.9240000247955322},{"id":"https://openalex.org/keywords/fine-grained-complexity","display_name":"fine-grained complexity","score":0.9010000228881836},{"id":"https://openalex.org/keywords/3-uniform-hypergraphs","display_name":"3-uniform hypergraphs","score":0.9139999747276306},{"id":"https://openalex.org/keywords/max-3sat","display_name":"MAX-3SAT","score":0.9950000047683716},{"id":"https://openalex.org/keywords/matrix-multiplication-exponent","display_name":"matrix multiplication exponent","score":0.8399999737739563},{"id":"https://openalex.org/keywords/3d","display_name":"3D","score":0.4169999957084656}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7169199585914612},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7160133123397827},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6768750548362732},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6751729846000671},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.584144651889801},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5380051136016846},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5320649743080139},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5279713273048401},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5079701542854309},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47334980964660645},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.47221213579177856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10034403204917908},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs54457.2022.00059","doi":"https://doi.org/10.1109/focs54457.2022.00059","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs54457.2022.00059","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W286834056","https://openalex.org/W1511191949","https://openalex.org/W1569766464","https://openalex.org/W1986084080","https://openalex.org/W1989204408","https://openalex.org/W2003356218","https://openalex.org/W2015690843","https://openalex.org/W2018033449","https://openalex.org/W2019725409","https://openalex.org/W2022093184","https://openalex.org/W2046074631","https://openalex.org/W2055560312","https://openalex.org/W2057393374","https://openalex.org/W2077220042","https://openalex.org/W2077449861","https://openalex.org/W2079176421","https://openalex.org/W2100228661","https://openalex.org/W2101672259","https://openalex.org/W2127474646","https://openalex.org/W2151953637","https://openalex.org/W2163294576","https://openalex.org/W2171019266","https://openalex.org/W2191626561","https://openalex.org/W2327699610","https://openalex.org/W2507428467","https://openalex.org/W2564932975","https://openalex.org/W2778356976","https://openalex.org/W2803418903","https://openalex.org/W2885786319","https://openalex.org/W2963677308","https://openalex.org/W2965422163","https://openalex.org/W3001374881","https://openalex.org/W3004402411","https://openalex.org/W3026865537","https://openalex.org/W3032788150","https://openalex.org/W3116253690","https://openalex.org/W3130635127","https://openalex.org/W3137349107","https://openalex.org/W3138822026","https://openalex.org/W3185396325","https://openalex.org/W4292608687"],"related_works":["https://openalex.org/W6931710642","https://openalex.org/W4327672818","https://openalex.org/W2100228661","https://openalex.org/W2055560312","https://openalex.org/W1998505959","https://openalex.org/W7097631821","https://openalex.org/W2204501044","https://openalex.org/W1569766464","https://openalex.org/W7099547323","https://openalex.org/W2104018342"],"abstract_inverted_index":{"We":[0,118],"revisit":[1],"the":[2,8,11,29,106,134,188,201,222,234],"classic":[3],"geometric":[4],"problem":[5,20,30,150,203,223],"of":[6,10,13,51,195],"computing":[7],"volume":[9],"union":[12],"n":[14],"3-dimensional":[15],"axis-parallel":[16],"boxes":[17],"(Klee\u2019s":[18],"measure":[19,149],"in":[21,34,151,161,166],"$3":[22],"D$).":[23],"It":[24],"is":[25],"well":[26],"known":[27,213],"that":[28,72,141],"can":[31,179],"be":[32,114,180],"solved":[33],"time":[35],"$O\\left(n^{3":[36,143],"/":[37,53,144,184,197],"2}\\right)$":[38],"(Overmars,":[39],"Yap":[40],"SICOMP\u201991;":[41],"Chan":[42,219],"FOCS\u201913).":[43],"Can":[44],"we":[45,139],"justify":[46],"this":[47,73,120,165],"30-year":[48],"old":[49],"barrier":[50,74],"$n^{3":[52],"2":[54],"\\pm":[55],"o(1)}$":[56],"under":[57],"plausible":[58],"fine-grained":[59],"complexity":[60],"assumptions?":[61],"The":[62],"only":[63],"previous":[64],"conditional":[65,126],"lower":[66,127,177,231],"bound":[67,104,128,178,190,232],"(Chan":[68],"Comp.":[69,217],"Geom.\u201910)":[70],"shows":[71],"holds":[75],"for":[76,85,129,147,158,174,224,233],"purely":[77],"combinatorial":[78],"algorithms,":[79,131],"i.e.,":[80],"algorithms":[81,215],"avoiding":[82],"algebraic":[83,96],"techniques":[84],"fast":[86],"matrix":[87,107],"multiplication.":[88],"This":[89],"leaves":[90],"open":[91],"an":[92,142],"algorithmic":[93],"improvement":[94],"exploiting":[95],"techniques,":[97],"and":[98,199],"does":[99],"not":[100],"give":[101,154,169],"any":[102],"superlinear":[103],"if":[105],"multiplication":[108],"exponent":[109],"$\\omega$":[110],"turns":[111],"out":[112],"to":[113,116,182,192],"equal":[115],"2.":[117],"resolve":[119],"issue":[121],"by":[122],"giving":[123],"a":[124,155,170,193],"tight":[125],"general":[130,202,235],"based":[132],"on":[133],"3-uniform":[135,162],"hyperclique":[136],"hypothesis.":[137],"Specifically,":[138],"prove":[140],"2-\\epsilon}\\right)$":[145],"algorithm":[146,157],"Klee\u2019s":[148],"3D":[152],"would":[153,168],"$O\\left(n^{k-\\epsilon^{\\prime}}\\right)$-time":[156],"counting":[159],"k-cliques":[160],"hypergraphs":[163],"-":[164],"turn":[167],"novel":[171],"$O\\left(\\left(2-\\epsilon^{\\prime":[172],"\\prime}\\right)^{n}\\right)$-algorithm":[173],"Max-3SAT.":[175],"Our":[176],"generalized":[181],"$n^{\\frac{d}{3-3":[183],"d}}-o(1)$,":[185],"which":[186],"matches":[187],"upper":[189],"up":[191],"factor":[194],"$n^{\\frac{d-3}{6-6":[196],"d}+o(1)}$":[198],"separates":[200],"from":[204],"popular":[205],"special":[206],"cases:":[207],"For":[208],"all":[209],"$d":[210],"\\geq":[211],"3$,":[212],"$\\tilde{O}\\left(n^{\\frac{d+1}{3}}\\right)$":[214],"(Bringmann":[216],"Geom.\u201912;":[218],"FOCS\u201913)":[220],"compute":[221],"arbitrary":[225],"hypercubes":[226],"polynomially":[227],"faster":[228],"than":[229],"our":[230],"problem.":[236]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4313227199","counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2023-01-06T00:00:00"}
