Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
From small space to small width in resolution
KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.ORCID-id: 0000-0003-4003-3168
KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.
KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.ORCID-id: 0000-0002-2700-4285
Vise andre og tillknytning
2014 (engelsk)Inngår i: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 2014, Vol. 25, s. 300-311Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of formulas is always an upper bound on the width needed to refute them. Their proof is beautiful but somewhat mysterious in that it relies heavily on tools from finite model theory. We give an alternative, completely elementary, proof that works by simple syntactic manipulations of resolution refutations. As a by-product, we develop a "black-box" technique for proving space lower bounds via a "static" complexity measure that works against any resolution refutation-previous techniques have been inherently adaptive. We conclude by showing that the related question for polynomial calculus (i.e., whether space is an upper bound on degree) seems unlikely to be resolvable by similar methods.

sted, utgiver, år, opplag, sider
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 2014. Vol. 25, s. 300-311
Serie
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969 ; 25
Emneord [en]
PCR, Polynomial calculus, Proof complexity, Resolution, Space, Width
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-158079DOI: 10.4230/LIPIcs.STACS.2014.300Scopus ID: 2-s2.0-84907818998ISBN: 978-393989765-1 (tryckt)OAI: oai:DiVA.org:kth-158079DiVA, id: diva2:774286
Konferanse
31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, Lyon, France, 5 March 2014 through 8 March 2014
Merknad

QC 20141222

Tilgjengelig fra: 2014-12-22 Laget: 2014-12-22 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Lauria, MassimoNordström, JakobVinyals, Marc

Søk i DiVA

Av forfatter/redaktør
Lauria, MassimoMikša, MladenNordström, JakobVinyals, Marc
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 33 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf