{"id":"https://openalex.org/W3196775331","doi":"https://doi.org/10.1016/j.tcs.2021.09.006","title":"The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems","display_name":"The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems","publication_year":2021,"publication_date":"2021-09-08","ids":{"openalex":"https://openalex.org/W3196775331","doi":"https://doi.org/10.1016/j.tcs.2021.09.006","mag":"3196775331"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2021.09.006","doi":"https://doi.org/10.1016/j.tcs.2021.09.006","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2021.09.006","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397521005211/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/S0304397521005211/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101920004","display_name":"Peter J\u00f6nsson","orcid":"https://orcid.org/0000-0002-5288-3330","observed_orcids":["https://orcid.org/0000-0002-5288-3330"]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089123758","display_name":"Victor Lagerkvist","orcid":"https://orcid.org/0000-0001-8144-4145","observed_orcids":["https://orcid.org/0000-0001-8144-4145"]},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Victor Lagerkvist","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024018030","display_name":"Johannes Schmidt","orcid":"https://orcid.org/0000-0001-8551-1624","observed_orcids":["https://orcid.org/0000-0001-8551-1624"]},"institutions":[{"id":"https://openalex.org/I94616838","display_name":"J\u00f6nk\u00f6ping University","ror":"https://ror.org/03t54am93","country_code":"SE","type":"education","lineage":["https://openalex.org/I94616838"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johannes Schmidt","raw_affiliation_strings":["Department of Computer Science and Informatics, J\u00f6nk\u00f6ping University, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8551-1624","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Informatics, J\u00f6nk\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I94616838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090440693","display_name":"Hannes Uppman","orcid":"https://orcid.org/0000-0003-0003-9127","observed_orcids":["https://orcid.org/0000-0003-0003-9127"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hannes Uppman","raw_affiliation_strings":["Link\u00f6ping, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0003-9127","affiliations":[{"raw_affiliation_string":"Link\u00f6ping, Sweden","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089123758"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":2220,"currency":"USD","value_usd":2220},"apc_paid":{"value":2220,"currency":"USD","value_usd":2220},"fwci":0.2506,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51931155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":"892","issue":null,"first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9765999913215637,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9765999913215637,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.020400000736117363,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0013000000035390258,"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/exponential-time-hypothesis","display_name":"Exponential Time Hypothesis","score":0.8939999938011169},{"id":"https://openalex.org/keywords/fine-grained-complexity","display_name":"fine-grained complexity","score":0.8299999833106995},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.7599999904632568},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7279999852180481},{"id":"https://openalex.org/keywords/logical-reasoning","display_name":"logical reasoning","score":0.492000013589859},{"id":"https://openalex.org/keywords/optimization-problems","display_name":"optimization problems","score":0.6980000138282776}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8061866760253906},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.7225666046142578},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6623467803001404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6496719121932983},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.521121084690094},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4976809322834015},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47324758768081665},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4686189293861389},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4377962648868561},{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.4144715666770935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3516225814819336},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3269100785255432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3090178370475769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2993583679199219},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.tcs.2021.09.006","doi":"https://doi.org/10.1016/j.tcs.2021.09.006","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2021.09.006","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397521005211/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:liu-180889","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-180889","pdf_url":null,"source":{"id":"https://openalex.org/S4306400838","display_name":"DiVA (Linkoping University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I102134673","host_organization_name":"Link\u00f6ping University","host_organization_lineage":["https://openalex.org/I102134673"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2021.09.006","doi":"https://doi.org/10.1016/j.tcs.2021.09.006","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2021.09.006","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397521005211/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/4","display_name":"Quality education"}],"study_designs":[],"awards":[{"id":"https://openalex.org/G2488160141","display_name":"Fine-Grained Complexity of Satisfiability and Constraint Satisfaction Problems","funder_award_id":"2019-03690","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G8024612177","display_name":"Infinite-domain Constraint Satisfaction: Computational Complexity and Efficient Algorithms","funder_award_id":"2017-04112","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3196775331.pdf","grobid_xml":"https://content.openalex.org/works/W3196775331.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W172361097","https://openalex.org/W649821374","https://openalex.org/W1542902132","https://openalex.org/W1554715854","https://openalex.org/W1556385097","https://openalex.org/W1569871753","https://openalex.org/W1571873445","https://openalex.org/W1589711670","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W1998601876","https://openalex.org/W2004984049","https://openalex.org/W2025319967","https://openalex.org/W2046420210","https://openalex.org/W2055356006","https://openalex.org/W2067081844","https://openalex.org/W2068190866","https://openalex.org/W2113666441","https://openalex.org/W2132104546","https://openalex.org/W2133260738","https://openalex.org/W2142482847","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2249739104","https://openalex.org/W2324696293","https://openalex.org/W2504838369","https://openalex.org/W2519743841","https://openalex.org/W2531563875","https://openalex.org/W2605041732","https://openalex.org/W2606192553","https://openalex.org/W2912532202","https://openalex.org/W2913507641","https://openalex.org/W3009318933","https://openalex.org/W3034994128","https://openalex.org/W3123582908","https://openalex.org/W4241387086","https://openalex.org/W4286834951","https://openalex.org/W6621413381","https://openalex.org/W6633370509","https://openalex.org/W6633538511","https://openalex.org/W6635454507","https://openalex.org/W6679758622","https://openalex.org/W6684468096","https://openalex.org/W6700919460","https://openalex.org/W6736051180","https://openalex.org/W6758768306","https://openalex.org/W6779852026","https://openalex.org/W6840922487","https://openalex.org/W6886175930"],"related_works":["https://openalex.org/W1561093606","https://openalex.org/W2173621488","https://openalex.org/W4245692971","https://openalex.org/W4389156785","https://openalex.org/W2113885662","https://openalex.org/W1983207144","https://openalex.org/W2953319076","https://openalex.org/W2123481932","https://openalex.org/W2914832887","https://openalex.org/W2563912921"],"abstract_inverted_index":{"Obtaining":[0],"lower":[1],"bounds":[2],"for":[3,7,80],"NP-hard":[4,64,131],"problems":[5,132,150],"has":[6],"a":[8,49,124],"long":[9],"time":[10,30,117,135,154],"been":[11],"an":[12],"active":[13],"area":[14],"of":[15,32,40,141,147],"research.":[16],"Algebraic":[17],"techniques":[18],"introduced":[19],"by":[20],"Jonsson":[21],"et":[22],"al.":[23],"(2017)":[24],"[4]":[25],"show":[26,74],"that":[27,53,75],"the":[28,33,38,81,85,89,94,111,139,148,152],"fine-grained":[29],"complexity":[31],"parameterized":[34],"problem":[35,99],"correlates":[36],"to":[37,151],"lattice":[39],"strong":[41],"partial":[42],"clones.":[43],"With":[44],"this":[45,67,71],"ordering":[46],"they":[47,122],"isolated":[48],"relation":[50],"R":[51],"such":[52,76],"can":[54,127],"be":[55,107,128],"solved":[56],"at":[57],"least":[58],"as":[59,61,130],"fast":[60],"any":[62],"other":[63],"problem.":[65],"In":[66],"paper":[68],"we":[69,144],"extend":[70],"method":[72],"and":[73,93,118],"languages":[77,105,143],"also":[78],"exist":[79],"surjective":[82],"SAT":[83],"problem,":[84,88,92],"max":[86],"ones":[87],"propositional":[90],"abduction":[91],"Boolean":[95],"valued":[96],"constraint":[97,102],"satisfaction":[98],"over":[100],"finite-valued":[101],"languages.":[103],"These":[104],"may":[106],"interesting":[108],"when":[109],"investigating":[110],"borderline":[112],"between":[113],"polynomial":[114],"time,":[115],"subexponential":[116],"exponential-time":[119],"algorithms":[120],"since":[121],"in":[123,157],"precise":[125],"sense":[126],"regarded":[129],"with":[133,138],"minimum":[134],"complexity.":[136],"Indeed,":[137],"help":[140],"these":[142],"relate":[145],"all":[146],"above":[149],"exponential":[153],"hypothesis":[155],"(ETH)":[156],"several":[158],"different":[159],"ways.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-10T00:00:00"}