{"id":"https://openalex.org/W4235156957","doi":"https://doi.org/10.1145/3196275","title":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","display_name":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","publication_year":2018,"publication_date":"2018-12-18","ids":{"openalex":"https://openalex.org/W4235156957","doi":"https://doi.org/10.1145/3196275"},"language":"en","primary_location":{"id":"doi:10.1145/3196275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3196275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3196275","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3196275","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103134901","display_name":"Jiawei Gao","orcid":"https://orcid.org/0000-0002-3759-2367"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jiawei Gao","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russell Impagliazzo","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003773985","display_name":"Antonina Kolokolova","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Antonina Kolokolova","raw_affiliation_strings":["Memorial University of Newfoundland, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Memorial University of Newfoundland, Canada","institution_ids":["https://openalex.org/I130438778"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["MIT, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103134901"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":1.2896,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83573574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"15","issue":"2","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T11567","display_name":"semigroups and automata theory","score":0.9968000054359436,"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/tuple","display_name":"Tuple","score":0.7266150712966919},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5834249258041382},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5714319348335266},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5558602213859558},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5268634557723999},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5023713111877441},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4993758201599121},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47763219475746155},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.46876734495162964},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4683137834072113},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4673481583595276},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46576738357543945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44869494438171387},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42148810625076294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36075466871261597},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.35786861181259155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32031720876693726}],"concepts":[{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.7266150712966919},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5834249258041382},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5714319348335266},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5558602213859558},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5268634557723999},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5023713111877441},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4993758201599121},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47763219475746155},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.46876734495162964},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4683137834072113},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4673481583595276},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46576738357543945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44869494438171387},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42148810625076294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36075466871261597},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35786861181259155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32031720876693726},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3196275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3196275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3196275","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3196275","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3196275","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3196275","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2556685859","display_name":null,"funder_award_id":"CCF-1213151","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3754174102","display_name":"CAREER: Common Links in Algorithms and Complexity","funder_award_id":"1552651","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4315067093","display_name":null,"funder_award_id":"CCF-1213151, CCF-1552651 (CAREER)","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4665588187","display_name":null,"funder_award_id":"CCF-1552651","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332603","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4235156957.pdf","grobid_xml":"https://content.openalex.org/works/W4235156957.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1499093134","https://openalex.org/W1764956874","https://openalex.org/W1950402288","https://openalex.org/W1989783863","https://openalex.org/W1998918799","https://openalex.org/W2004130530","https://openalex.org/W2026036943","https://openalex.org/W2042194938","https://openalex.org/W2042654457","https://openalex.org/W2045583484","https://openalex.org/W2055693471","https://openalex.org/W2083820240","https://openalex.org/W2083951446","https://openalex.org/W2084732238","https://openalex.org/W2084803275","https://openalex.org/W2121770144","https://openalex.org/W2154935036","https://openalex.org/W2158747250","https://openalex.org/W2178011018","https://openalex.org/W2293041988","https://openalex.org/W2294619171","https://openalex.org/W2296148711","https://openalex.org/W2401929940","https://openalex.org/W2998808137","https://openalex.org/W3150645827","https://openalex.org/W4206701711"],"related_works":["https://openalex.org/W4245395944","https://openalex.org/W2143551613","https://openalex.org/W1979740464","https://openalex.org/W2138823233","https://openalex.org/W2143345456","https://openalex.org/W2023236823","https://openalex.org/W1605933025","https://openalex.org/W2963994172","https://openalex.org/W2499743893","https://openalex.org/W2083659666"],"abstract_inverted_index":{"Properties":[0],"definable":[1],"in":[2,97],"first-order":[3,32,105,179],"logic":[4],"are":[5,28,164],"algorithmically":[6],"interesting":[7],"for":[8,44,77,103,152,175,234],"both":[9,162,222],"theoretical":[10],"and":[11,25,30,225],"pragmatic":[12],"reasons.":[13],"Many":[14],"of":[15,88,95,155,169,178,195,209,218],"the":[16,31,61,86,89,93,135,156,170,176,190,206,216,229],"most":[17],"studied":[18],"algorithmic":[19],"problems,":[20],"such":[21,68,231],"as":[22,36],"Hitting":[23],"Set":[24],"Orthogonal":[26,158,172,192],"Vectors,":[27],"first-order,":[29],"properties":[33,69,180],"naturally":[34],"arise":[35],"relational":[37],"database":[38],"queries.":[39],"A":[40],"relatively":[41],"straightforward":[42],"algorithm":[43,194],"evaluating":[45],"a":[46,126,235],"property":[47,106],"with":[48],"k":[49,57,74,114],"+1":[50],"quantifiers":[51],"takes":[52],"time":[53,76],"O":[54,71],"(":[55,72],"m":[56,73,84,113],")":[58,120],"and,":[59],"assuming":[60],"Strong":[62],"Exponential":[63],"Time":[64],"Hypothesis":[65],"(SETH),":[66],"some":[67],"require":[70],"\u2212\u03f5)":[75],"any":[78,130],"\u03f5":[79],">":[80,83],"0.":[81],"(Here,":[82],"represents":[85],"size":[87],"input":[90],"structure,":[91],"i.e.,":[92,122],"number":[94],"tuples":[96],"all":[98],"relations.)":[99],"We":[100],"give":[101],"algorithms":[102,151],"every":[104],"that":[107,144,203],"improves":[108],"this":[109,227],"upper":[110],"bound":[111],"to":[112,138,149,214],"/2":[115],"\u0398":[116],"(\u221a":[117],"log":[118],"n":[119],",":[121],"an":[123],"improvement":[124,146],"by":[125,166],"factor":[127],"more":[128],"than":[129,134],"poly-log,":[131],"but":[132],"less":[133],"polynomial":[136],"required":[137],"refute":[139],"SETH.":[140],"Moreover,":[141],"we":[142,188],"show":[143],"further":[145],"is":[147,228],"equivalent":[148],"improving":[150],"sparse":[153],"instances":[154],"well-studied":[157],"Vectors":[159,173,193],"problem.":[160],"Surprisingly,":[161],"results":[163],"obtained":[165],"showing":[167],"completeness":[168,232],"Sparse":[171],"problem":[174],"class":[177],"under":[181],"fine-grained":[182,200],"reductions.":[183],"To":[184],"obtain":[185],"improved":[186],"algorithms,":[187],"apply":[189],"fast":[191],"References":[196],"[3,":[197],"16].":[198],"While":[199],"reductions":[201],"(reductions":[202],"closely":[204],"preserve":[205],"conjectured":[207],"complexities":[208],"problems)":[210],"have":[211],"been":[212],"used":[213],"relate":[215],"hardness":[217],"disparate":[219],"specific":[220],"problems":[221],"within":[223],"P":[224],"beyond,":[226],"first":[230],"result":[233],"standard":[236],"complexity":[237],"class.":[238]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}