{"id":"https://openalex.org/W255293273","doi":"https://doi.org/10.1109/focs.2008.42","title":"Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution","display_name":"Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W255293273","doi":"https://doi.org/10.1109/focs.2008.42","mag":"255293273"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2008.42","doi":"https://doi.org/10.1109/focs.2008.42","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2008.42","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 49th Annual IEEE Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W255293273"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5058111762","display_name":"Eli Ben\u2010Sasson","orcid":"https://orcid.org/0000-0002-0708-0483","observed_orcids":["https://orcid.org/0000-0002-0708-0483"]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eli Ben-Sasson","raw_affiliation_strings":["Comput. Sci. Dept. Technion, Technion - Israel Inst. of Technol., Haifa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Comput. Sci. Dept. Technion, Technion - Israel Inst. of Technol., Haifa","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003633660","display_name":"Jakob Nordstr\u00f6m","orcid":"https://orcid.org/0000-0002-2700-4285","observed_orcids":["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":["Sch. of Comput. Sci. & Commun., R. Inst. of Technol., Stockholm"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sch. of Comput. Sci. & Commun., R. Inst. of Technol., Stockholm","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2558,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.93064124,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":"16","issue":null,"first_page":"709","last_page":"718"},"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.9208999872207642,"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.9208999872207642,"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.04800000041723251,"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.007600000128149986,"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/resolution-proofs","display_name":"resolution proofs","score":0.8669999837875366},{"id":"https://openalex.org/keywords/proof-length","display_name":"proof length","score":0.9940000176429749},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9070000052452087},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"proof complexity","score":0.7110000252723694}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8780355453491211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6454178690910339},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6096142530441284},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5900864005088806},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5853516459465027},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.502178430557251},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48051226139068604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4736793339252472},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4306570291519165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2032475769519806},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06773015856742859},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/focs.2008.42","doi":"https://doi.org/10.1109/focs.2008.42","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2008.42","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 49th Annual IEEE Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.180.6874","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.6874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/jakobn/research/ShortProofs_FOCS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.180.7132","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.7132","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/jakobn/research/ShortProofs_ECCC.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:b9f6c820-6f6f-4bb4-bdb4-e99495954c98","doi":null,"is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/b9f6c820-6f6f-4bb4-bdb4-e99495954c98","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,"listed_in":[],"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 - Annual IEEE Symposium on Foundations of Computer Science, FOCS; pp 709-718 (2008)","raw_type":"info:eu-repo/semantics/conferencePaper"},{"id":"mag:255293273","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc16.html#Ben-SassonN09","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W38318608","https://openalex.org/W116891159","https://openalex.org/W343133375","https://openalex.org/W1523895317","https://openalex.org/W1537186801","https://openalex.org/W1567600461","https://openalex.org/W1577460141","https://openalex.org/W1594956262","https://openalex.org/W1974070050","https://openalex.org/W1978701879","https://openalex.org/W1996660205","https://openalex.org/W1997338813","https://openalex.org/W1998430462","https://openalex.org/W2014963708","https://openalex.org/W2026967932","https://openalex.org/W2040504571","https://openalex.org/W2044722214","https://openalex.org/W2047237020","https://openalex.org/W2048958388","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2062934582","https://openalex.org/W2067642391","https://openalex.org/W2069767473","https://openalex.org/W2071347463","https://openalex.org/W2074946288","https://openalex.org/W2081692349","https://openalex.org/W2084384424","https://openalex.org/W2092984557","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2101942101","https://openalex.org/W2126420408","https://openalex.org/W2130081235","https://openalex.org/W2133527541","https://openalex.org/W2142127354","https://openalex.org/W2154976719","https://openalex.org/W2229701631","https://openalex.org/W2611365002","https://openalex.org/W3022335368","https://openalex.org/W4242993568","https://openalex.org/W4245630182","https://openalex.org/W6679878532"],"related_works":["https://openalex.org/W1567846816","https://openalex.org/W3166842031","https://openalex.org/W7100048320","https://openalex.org/W106894730","https://openalex.org/W1627538354","https://openalex.org/W7095699694","https://openalex.org/W1262446233","https://openalex.org/W7100376270","https://openalex.org/W7095119306","https://openalex.org/W2074834475"],"abstract_inverted_index":{"A":[0,16],"number":[1],"of":[2,13,24,31,62,65,76,100,123,138,166,176],"works":[3],"have":[4,73],"looked":[5],"at":[6],"the":[7,22,29,45,52,92,120,134,139],"relationship":[8],"between":[9],"length":[10,77,101],"and":[11,156],"space":[12,85,111,121,178],"resolution":[14,74],"proofs.":[15],"notorious":[17],"question":[18,46],"has":[19],"been":[20],"whether":[21],"existence":[23,30],"a":[25,32,108,129,162,172],"short":[26],"proof":[27,33,83,99,109,141,177],"implies":[28],"that":[34,58,72],"can":[35,103],"be":[36,105],"verified":[37],"using":[38],"limited":[39],"space.In":[40],"this":[41],"paper":[42],"we":[43],"resolve":[44],"by":[47,118],"answering":[48],"it":[49,160],"negatively":[50],"in":[51,110,152],"strongest":[53,93],"possible":[54,96],"way.":[55],"We":[56],"show":[57],"there":[59],"are":[60],"families":[61],"6-CNF":[63],"formulas":[64,127,168],"size":[66],"n,":[67,71],"for":[68,80,171],"arbitrarily":[69],"large":[70],"proofs":[75],"O(n)":[78,102],"but":[79],"which":[81,169],"any":[82,98],"requires":[84],"Omega(n":[86],"/":[87,113],"log":[88,114],"n).":[89],"This":[90],"is":[91,142],"asymptotic":[94],"separation":[95],"since":[97],"always":[104],"transformed":[106],"into":[107],"O(n":[112],"n).Our":[115],"result":[116],"follows":[117],"reducing":[119],"complexity":[122],"so":[124],"called":[125],"pebbling":[126,136,167,182],"over":[128],"directed":[130],"acyclic":[131],"graph":[132],"to":[133,179],"black-white":[135,181],"price":[137],"graph.The":[140],"somewhat":[143],"simpler":[144],"than":[145],"previous":[146],"results":[147],"(in":[148],"particular,":[149],"those":[150],"reported":[151],"[Nordstrom":[153],"2006,":[154],"Nordstrom":[155],"Hastad":[157],"2008])":[158],"as":[159],"uses":[161],"slightly":[163],"different":[164],"flavor":[165],"allows":[170],"rather":[173],"straightforward":[174],"reduction":[175],"standard":[180],"price.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}