{"id":"https://openalex.org/W7118721139","doi":"https://doi.org/10.1137/1.9781611978971.71","title":"Circuits and Backdoors: Five Shades of the SETH","display_name":"Circuits and Backdoors: Five Shades of the SETH","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118721139","doi":"https://doi.org/10.1137/1.9781611978971.71"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.71","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.71","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","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/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["PSL University"],"affiliations":[{"raw_affiliation_string":"PSL University","institution_ids":["https://openalex.org/I2746051580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059698872"],"corresponding_institution_ids":["https://openalex.org/I2746051580"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29567308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1945","last_page":"2001"},"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.4187000095844269,"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.4187000095844269,"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.4020000100135803,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.02239999920129776,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7699999809265137},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4997999966144562},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.49619999527931213},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4544999897480011},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41600000858306885},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.39340001344680786},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.36169999837875366},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.34220001101493835}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7699999809265137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5770999789237976},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5029000043869019},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4997999966144562},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.49619999527931213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49410000443458557},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4544999897480011},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39489999413490295},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.39340001344680786},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.34220001101493835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33469998836517334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.2906999886035919},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26010000705718994},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.25859999656677246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.71","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.71","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"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":{"The":[0],"Strong":[1],"Exponential":[2],"Time":[3],"Hypothesis":[4],"(SETH)":[5],"is":[6,54],"a":[7,25,91,105,110],"standard":[8],"assumption":[9],"in":[10],"(fine-grained)":[11],"parameterized":[12],"complexity":[13,38,80],"and":[14,47,70],"many":[15],"tight":[16],"lower":[17,114],"bounds":[18,115],"are":[19,60,83],"based":[20],"on":[21],"it.":[22],"We":[23],"consider":[24],"number":[26],"of":[27,30,73,93,98,112],"reasonable":[28],"weakenings":[29],"the":[31],"SETH,":[32],"with":[33],"sources":[34],"from":[35,78],"(i)":[36],"circuit":[37],"(ii)":[39],"backdoors":[40],"for":[41],"SAT-solving":[42],"(iii)":[43],"graph":[44],"width":[45],"parameters":[46],"(iv)":[48],"weighted":[49],"satisfiability":[50],"problems.":[51],"Our":[52],"goal":[53],"to":[55,85],"arrive":[56],"at":[57],"formulations":[58],"which":[59],"simultaneously":[61],"more":[62],"plausible":[63],"as":[64,104],"hypotheses,":[65],"but":[66],"also":[67],"capture":[68],"interesting":[69],"robust":[71],"notions":[72],"complexity.":[74],"Using":[75],"several":[76],"tools":[77],"classical":[79],"theory":[81],"we":[82],"able":[84],"consolidate":[86],"these":[87],"numerous":[88],"hypotheses":[89],"into":[90,116],"hierarchy":[92],"five":[94],"main":[95],"equivalence":[96,118],"classes":[97],"increasing":[99],"solidity.":[100],"This":[101],"framework":[102],"serves":[103],"step":[106],"towards":[107],"structurally":[108],"classifying":[109],"variety":[111],"SETH-based":[113],"intermediate":[117],"classes.":[119]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}