{"id":"https://openalex.org/W4384344721","doi":"https://doi.org/10.1109/lics56636.2023.10175675","title":"Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF","display_name":"Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF","publication_year":2023,"publication_date":"2023-06-26","ids":{"openalex":"https://openalex.org/W4384344721","doi":"https://doi.org/10.1109/lics56636.2023.10175675"},"language":"en","primary_location":{"id":"doi:10.1109/lics56636.2023.10175675","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/lics56636.2023.10175675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","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/A5089442472","display_name":"Johannes K. Fichte","orcid":"https://orcid.org/0000-0002-8681-7470"},"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":"Johannes K. Fichte","raw_affiliation_strings":["Linköping University,Department of Computer and Information Science (IDA),Linköping,Sweden,SE-581 83"],"affiliations":[{"raw_affiliation_string":"Linköping University,Department of Computer and Information Science (IDA),Linköping,Sweden,SE-581 83","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien,Wien,Austria,1040"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien,Wien,Austria,1040","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056989280","display_name":"Markus Hecher","orcid":"https://orcid.org/0000-0003-0131-6771"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Markus Hecher","raw_affiliation_strings":["Massachusetts Institute of Technology,Cambridge,MA,USA,02139"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology,Cambridge,MA,USA,02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011005221","display_name":"Friedrich Slivovsky","orcid":"https://orcid.org/0000-0003-1784-2346"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Friedrich Slivovsky","raw_affiliation_strings":["Institute of Logic and Computation, TU Wien,Wien,Austria,1040"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, TU Wien,Wien,Austria,1040","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017076947","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sebastian Ordyniak","raw_affiliation_strings":["University of Leeds,School of Computing,Leeds,United Kingdom,LS2 9JT"],"affiliations":[{"raw_affiliation_string":"University of Leeds,School of Computing,Leeds,United Kingdom,LS2 9JT","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5089442472"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.8068,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75801908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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.9958000183105469,"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/T10142","display_name":"Formal Methods in Verification","score":0.9936000108718872,"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.9851999878883362,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.6907638311386108},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6255362033843994},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5861543416976929},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5558308362960815},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5116665363311768},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4783470332622528},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4435345232486725},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44179368019104004},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4364754557609558},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43627864122390747},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43253618478775024},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.43170490860939026},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4254439175128937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4208206236362457},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4108218550682068},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4031909108161926},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22799670696258545},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.19991883635520935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19506138563156128}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6907638311386108},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6255362033843994},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5861543416976929},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5558308362960815},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5116665363311768},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4783470332622528},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4435345232486725},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44179368019104004},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4364754557609558},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43627864122390747},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43253618478775024},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.43170490860939026},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4254439175128937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4208206236362457},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4108218550682068},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4031909108161926},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22799670696258545},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.19991883635520935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19506138563156128},{"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.1109/lics56636.2023.10175675","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/lics56636.2023.10175675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":72,"referenced_works":["https://openalex.org/W45436251","https://openalex.org/W56447744","https://openalex.org/W1488842140","https://openalex.org/W1507341838","https://openalex.org/W1517036688","https://openalex.org/W1532942816","https://openalex.org/W1541340697","https://openalex.org/W1570891932","https://openalex.org/W1969474097","https://openalex.org/W1973302434","https://openalex.org/W1983648207","https://openalex.org/W1995725694","https://openalex.org/W1998084650","https://openalex.org/W1999038767","https://openalex.org/W2007316622","https://openalex.org/W2007381442","https://openalex.org/W2029940892","https://openalex.org/W2031823362","https://openalex.org/W2033405938","https://openalex.org/W2036095420","https://openalex.org/W2046194288","https://openalex.org/W2047871605","https://openalex.org/W2080192364","https://openalex.org/W2116087731","https://openalex.org/W2129131081","https://openalex.org/W2135989067","https://openalex.org/W2137407595","https://openalex.org/W2165930340","https://openalex.org/W2171984098","https://openalex.org/W2460257212","https://openalex.org/W2490706771","https://openalex.org/W2531190966","https://openalex.org/W2550548770","https://openalex.org/W2782564847","https://openalex.org/W2914414140","https://openalex.org/W2943060833","https://openalex.org/W2953191059","https://openalex.org/W2966185954","https://openalex.org/W2984546510","https://openalex.org/W3002754118","https://openalex.org/W3006150593","https://openalex.org/W3010041377","https://openalex.org/W3016346123","https://openalex.org/W3030023697","https://openalex.org/W3040665423","https://openalex.org/W3040869546","https://openalex.org/W3083723648","https://openalex.org/W3102726227","https://openalex.org/W3128546480","https://openalex.org/W3189796792","https://openalex.org/W3217796817","https://openalex.org/W4206807714","https://openalex.org/W4213009134","https://openalex.org/W4214702250","https://openalex.org/W4220653067","https://openalex.org/W4232532984","https://openalex.org/W4232896595","https://openalex.org/W4245630182","https://openalex.org/W4253175698","https://openalex.org/W4300550233","https://openalex.org/W4381707996","https://openalex.org/W6601819647","https://openalex.org/W6602270878","https://openalex.org/W6632263310","https://openalex.org/W6658185778","https://openalex.org/W6684440478","https://openalex.org/W6728215811","https://openalex.org/W6729666896","https://openalex.org/W6750289833","https://openalex.org/W6773464018","https://openalex.org/W6800930026","https://openalex.org/W7015578920"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W41549461","https://openalex.org/W2767174160","https://openalex.org/W2113684989","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W4389814085","https://openalex.org/W1531868704","https://openalex.org/W1667353902"],"abstract_inverted_index":{"The":[0],"QSAT":[1,58,102,162,195],"problem,":[2],"which":[3,126,163],"asks":[4],"to":[5,64,129],"evaluate":[6],"a":[7,77,93,165],"quantified":[8],"Boolean":[9],"formula":[10],"(QBF),":[11],"is":[12,24,55],"of":[13,46,51,69,98,101,108,112,139,168,200],"fundamental":[14],"interest":[15],"in":[16,95],"approximation,":[17],"counting,":[18],"decision,":[19],"and":[20,23,185],"probabilistic":[21],"complexity":[22,100,171],"also":[25,177],"considered":[26],"the":[27,47,70,74,83,99,106,169,201],"prototypical":[28],"PSPACE-complete":[29,60],"problem.":[30],"As":[31],"such,":[32],"it":[33,54],"has":[34],"previously":[35],"been":[36],"studied":[37],"under":[38,172,196],"various":[39],"structural":[40],"restrictions":[41],"(parameters),":[42],"most":[43,114],"notably":[44,115],"parameterizations":[45,199],"primal":[48,71,202],"graph":[49,183],"representation":[50],"instances.":[52],"Indeed,":[53],"known":[56],"that":[57],"remains":[59],"even":[61],"when":[62,103],"restricted":[63,137],"instances":[65,138,142],"with":[66,158],"constant":[67],"treewidth":[68],"graph,":[72],"but":[73],"problem":[75],"admits":[76],"double-exponential":[78],"fixed-parameter":[79],"algorithm":[80],"parameterized":[81],"by":[82],"vertex":[84,151],"cover":[85],"number":[86],"(primal":[87],"graph).However,":[88],"prior":[89],"works":[90],"have":[91,146],"left":[92],"gap":[94],"our":[96],"understanding":[97],"viewed":[104],"from":[105],"perspective":[107],"other":[109,181],"natural":[110,182],"representations":[111],"instances,":[113],"via":[116],"incidence":[117,144],"graphs.":[118],"In":[119],"this":[120],"paper,":[121],"we":[122],"develop":[123],"structure-aware":[124],"reductions":[125],"allow":[127],"us":[128],"obtain":[130,186],"essentially":[131],"tight":[132],"lower":[133,156,192],"bounds":[134,157,193],"for":[135,161,180,194],"highly":[136],"QSAT,":[140],"including":[141],"whose":[143],"graphs":[145],"bounded":[147],"treedepth":[148],"or":[149],"feedback":[150],"number.":[152],"We":[153,176],"complement":[154],"these":[155],"novel":[159,187],"algorithms":[160],"establish":[164],"nearly-complete":[166],"picture":[167],"problem's":[170],"standard":[173],"graph-theoretic":[174],"parameterizations.":[175],"show":[178],"implications":[179],"representations,":[184],"upper":[188],"as":[189,191],"well":[190],"more":[197],"fine-grained":[198],"graph.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}