{"id":"https://openalex.org/W2154976719","doi":"https://doi.org/10.1145/1374376.1374478","title":"Towards an optimal separation of space and length in resolution","display_name":"Towards an optimal separation of space and length in resolution","publication_year":2008,"publication_date":"2008-05-17","ids":{"openalex":"https://openalex.org/W2154976719","doi":"https://doi.org/10.1145/1374376.1374478","mag":"2154976719"},"language":"en","primary_location":{"id":"doi:10.1145/1374376.1374478","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5003633660","display_name":"Jakob Nordstr\u0094\u00f6m","orcid":"https://orcid.org/0000-0002-2700-4285"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jakob Nordstr\u00f6m","raw_affiliation_strings":["Royal Institute of Technology (KTH), Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":["Royal Institute of Technology (KTH), Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":2.2856,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.88759353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"83","issue":null,"first_page":"701","last_page":"710"},"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.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.998199999332428,"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/mathematical-proof","display_name":"Mathematical proof","score":0.8387352228164673},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.7908929586410522},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6760213375091553},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6335304975509644},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.6175538301467896},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5899226069450378},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5881235599517822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49015364050865173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4847123622894287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4664069712162018},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4439902603626251},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3464832305908203},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11624372005462646}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8387352228164673},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.7908929586410522},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6760213375091553},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6335304975509644},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.6175538301467896},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5899226069450378},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5881235599517822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49015364050865173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4847123622894287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4664069712162018},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4439902603626251},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3464832305908203},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11624372005462646},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1374376.1374478","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:d87bb537-615d-488c-89b2-5a2a6f0c2d1d","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/d87bb537-615d-488c-89b2-5a2a6f0c2d1d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Annual ACM Symposium on Theory of Computing; pp 701-710 (2008)","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W46668428","https://openalex.org/W116891159","https://openalex.org/W205968292","https://openalex.org/W255293273","https://openalex.org/W1537186801","https://openalex.org/W1567053297","https://openalex.org/W1567600461","https://openalex.org/W1577460141","https://openalex.org/W1594956262","https://openalex.org/W1957114827","https://openalex.org/W1974070050","https://openalex.org/W1978701879","https://openalex.org/W1988083342","https://openalex.org/W1990932978","https://openalex.org/W1996660205","https://openalex.org/W1997338813","https://openalex.org/W1998430462","https://openalex.org/W2006205541","https://openalex.org/W2014963708","https://openalex.org/W2015878287","https://openalex.org/W2036265926","https://openalex.org/W2036615169","https://openalex.org/W2039982637","https://openalex.org/W2044196316","https://openalex.org/W2044560939","https://openalex.org/W2044722214","https://openalex.org/W2047237020","https://openalex.org/W2054197381","https://openalex.org/W2057361103","https://openalex.org/W2061739322","https://openalex.org/W2062897452","https://openalex.org/W2062912795","https://openalex.org/W2062934582","https://openalex.org/W2066721455","https://openalex.org/W2067642391","https://openalex.org/W2069767473","https://openalex.org/W2071347463","https://openalex.org/W2074946288","https://openalex.org/W2076318470","https://openalex.org/W2081692349","https://openalex.org/W2084029169","https://openalex.org/W2084384424","https://openalex.org/W2088421560","https://openalex.org/W2090339500","https://openalex.org/W2092984557","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2102791214","https://openalex.org/W2108637261","https://openalex.org/W2109895531","https://openalex.org/W2117461856","https://openalex.org/W2126362918","https://openalex.org/W2126420408","https://openalex.org/W2129413084","https://openalex.org/W2133527541","https://openalex.org/W2142127354","https://openalex.org/W2158505527","https://openalex.org/W2164319662","https://openalex.org/W2229701631","https://openalex.org/W2611365002","https://openalex.org/W2611481948","https://openalex.org/W2730215775","https://openalex.org/W2985351939","https://openalex.org/W3022335368","https://openalex.org/W3184666341","https://openalex.org/W4250767659"],"related_works":["https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W2094368841","https://openalex.org/W2099785256","https://openalex.org/W4288055874","https://openalex.org/W187835144","https://openalex.org/W315696179","https://openalex.org/W2048447692","https://openalex.org/W2128006027"],"abstract_inverted_index":{"Most":[0],"state-of-the-art":[1],"satisfiability":[2],"algorithms":[3],"today":[4],"are":[5,162],"variants":[6],"of":[7,26,31,37,42,52,61,78,83,115],"the":[8,23,29,35,40,48,76,81,84,88,128,149,158,166],"DPLL":[9],"procedure":[10],"augmented":[11],"with":[12,98,175],"clause":[13,86],"learning.":[14],"The":[15],"main":[16],"bottleneck":[17],"for":[18,109,151],"such":[19],"algorithms,":[20],"other":[21],"than":[22],"obvious":[24],"one":[25],"time,":[27],"is":[28,117,133,141,148],"amount":[30],"memory":[32,45],"used.":[33],"In":[34],"field":[36],"proof":[38,67],"complexity,":[39],"resources":[41],"time":[43],"and":[44,50,101,111],"correspond":[46],"to":[47,64,75,94,177],"length":[49,100,110,137,152],"space":[51,116,146],"resolution":[53],"proofs.":[54],"There":[55],"has":[56,91,124],"been":[57,92,107],"a":[58,131],"long":[59],"line":[60],"research":[62],"trying":[63],"understand":[65],"these":[66,160],"complexity":[68],"measures,":[69],"as":[70,72],"well":[71],"relating":[73],"them":[74],"width":[77],"proofs,":[79],"i.e.,":[80],"size":[82],"largest":[85],"in":[87,135,144,165],"proof,":[89],"which":[90],"shown":[93],"be":[95,172],"intimately":[96],"connected":[97],"both":[99],"space.":[102,178],"While":[103],"strong":[104],"results":[105],"have":[106],"proven":[108],"width,":[112],"our":[113],"understanding":[114],"still":[118],"quite":[119],"poor.":[120],"For":[121],"instance,":[122],"it":[123,140],"remained":[125],"open":[126],"whether":[127,156],"fact":[129],"that":[130,139,168],"formula":[132],"provable":[134,143],"short":[136,169],"implies":[138],"also":[142],"small":[145],"(which":[147],"case":[150],"versus":[153],"width),":[154],"or":[155],"on":[157],"contrary":[159],"measures":[161],"completely":[163],"unrelated":[164],"sense":[167],"proofs":[170],"can":[171],"arbitrarily":[173],"complex":[174],"respect":[176]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}