{"id":"https://openalex.org/W2767724797","doi":"https://doi.org/10.23638/lmcs-15(1:13)2019","title":"Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs","display_name":"Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs","publication_year":2019,"publication_date":"2019-02-13","ids":{"openalex":"https://openalex.org/W2767724797","doi":"https://doi.org/10.23638/lmcs-15(1:13)2019","mag":"2767724797"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(1:13)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:13)2019","pdf_url":"https://lmcs.episciences.org/5184/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5184/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048382806","display_name":"Joshua Blinkhorn","orcid":"https://orcid.org/0000-0001-7452-6521"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joshua Blinkhorn","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038021028","display_name":"Luke Hinde","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luke Hinde","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042128349"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3999,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.61409792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"Volume 15, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9922999739646912,"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/mathematical-proof","display_name":"Mathematical proof","score":0.7854924201965332},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.7086855173110962},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6187613010406494},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5556789636611938},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5552300810813904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5237443447113037},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4505123496055603},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44714435935020447},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4386572241783142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43051207065582275},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4230915904045105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3312247395515442},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3277439475059509},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30050820112228394},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14681729674339294}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7854924201965332},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.7086855173110962},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6187613010406494},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5556789636611938},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5552300810813904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5237443447113037},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4505123496055603},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44714435935020447},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4386572241783142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43051207065582275},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4230915904045105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3312247395515442},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3277439475059509},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30050820112228394},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14681729674339294},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-15(1:13)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:13)2019","pdf_url":"https://lmcs.episciences.org/5184/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1712.03626","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.03626","pdf_url":"https://arxiv.org/pdf/1712.03626","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1712.03626","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1712.03626","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(1:13)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(1:13)2019","pdf_url":"https://lmcs.episciences.org/5184/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.41999998688697815}],"awards":[{"id":"https://openalex.org/G4794090369","display_name":null,"funder_award_id":"60842","funder_id":"https://openalex.org/F4320306193","funder_display_name":"John Templeton Foundation"}],"funders":[{"id":"https://openalex.org/F4320306193","display_name":"John Templeton Foundation","ror":"https://ror.org/035tnyy05"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2767724797.pdf","grobid_xml":"https://content.openalex.org/works/W2767724797.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2144319750"],"related_works":["https://openalex.org/W2099785256","https://openalex.org/W187835144","https://openalex.org/W315696179","https://openalex.org/W4288055874","https://openalex.org/W2186044446","https://openalex.org/W2945126541","https://openalex.org/W3196023996","https://openalex.org/W1533619009","https://openalex.org/W2509713809","https://openalex.org/W47204537"],"abstract_inverted_index":{"As":[0,115],"a":[1,25,44,60,82,88,127,148,182],"natural":[2],"extension":[3],"of":[4,10,22,37,81,87,94,117,130,150,159,168,185,191],"the":[5,35,38,79,85,92,105,118,154,165,178,188],"SAT":[6],"problem,":[7],"an":[8],"array":[9],"proof":[11,27,40,46,184],"systems":[12],"for":[13,63,126,147,187],"quantified":[14],"Boolean":[15],"formulas":[16,190],"(QBF)":[17],"have":[18],"been":[19],"proposed,":[20],"many":[21],"which":[23,162],"extend":[24],"propositional":[26,45],"system":[28,41,47],"to":[29,103,107,164,180],"handle":[30],"universal":[31,50],"quantification.":[32],"By":[33,90],"formalising":[34],"construction":[36],"QBF":[39,98,166],"obtained":[42],"from":[43],"by":[48],"adding":[49],"reduction":[51],"(Beyersdorff,":[52],"Bonacina":[53],"&":[54],"Chew,":[55],"ITCS":[56],"`16),":[57],"we":[58,100,120,176],"present":[59],"new":[61,128],"technique":[62,72,106,179],"proving":[64,140],"proof-size":[65],"lower":[66,109,124,142,157],"bounds":[67,110,125,143,158],"in":[68,96,139],"these":[69],"systems.":[70],"The":[71,135],"relies":[73],"only":[74],"on":[75,112],"two":[76],"semantic":[77],"measures:":[78],"cost":[80,113],"QBF,":[83],"and":[84,172,195],"capacity":[86,93],"proof.":[89],"examining":[91],"proofs":[95],"several":[97],"systems,":[99],"are":[101],"able":[102],"use":[104],"obtain":[108],"based":[111],"alone.":[114],"applications":[116],"technique,":[119],"first":[121,155],"prove":[122],"exponential":[123,141],"family":[129],"simple":[131,183],"QBFs":[132],"representing":[133],"equality.":[134],"main":[136],"application":[137],"is":[138],"with":[144],"high":[145],"probability":[146],"class":[149],"randomly":[151],"generated":[152],"QBFs,":[153],"`genuine'":[156],"this":[160],"kind,":[161],"apply":[163],"analogues":[167],"resolution,":[169],"Cutting":[170],"Planes,":[171],"Polynomial":[173],"Calculus.":[174],"Finally,":[175],"employ":[177],"give":[181],"hardness":[186],"prominent":[189],"Kleine":[192],"B\\"uning,":[193],"Karpinski":[194],"Fl\\"ogel.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}