Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the Relative Strength of Pebbling and Resolution
Massachusetts Institute of Technology.ORCID iD: 0000-0002-2700-4285
2010 (English)In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC '10), 2010, 151-162 p.Conference paper, Published paper (Refereed)
Abstract [en]

The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. The typical approach has been to encode the pebble game played on a graph as a CNF formula and then argue that proofs of this formula must inherit (various aspects of) the pebbling properties of the underlying graph. Unfortunately, the reductions used here are not tight. To simulate resolution proofs by pebblings, the full strength of nondeterministic black-white pebbling is needed, whereas resolution is only known to be able to simulate deterministic black pebbling. To obtain strong results, one therefore needs to find specific graph families which either have essentially the same properties for black and blackwhite pebbling (not at all true in general) or which admit simulations of black-white pebblings in resolution. This paper contributes to both these approaches. First, we design a restricted form of black-white pebbling that can be simulated in resolution and show that there are graph families for which such restricted pebblings can be asymptotically better than black pebblings. This proves that, perhaps somewhat unexpectedly, resolution can strictly beat black-only pebbling, and in particular that the space lower bounds on pebbling formulas in [Ben-Sasson and Nordstr¨om 2008] are tight. Second, we present a versatile parametrized graph family with essentially the same properties for black and black-white pebbling, which gives sharp simultaneous trade-offs for black and black-white pebbling for various parameter settings. Both of our contributions have been instrumental in obtaining the time-space trade-off results for resolution-based proof systems in [Ben-Sasson and Nordstr¨om 2009].

Place, publisher, year, edition, pages
2010. 151-162 p.
Series
Annual IEEE Conference on Computational Complexity, ISSN 1093-0159
Keyword [en]
complexity, resolution, pebble games, pebbling
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-63091DOI: 10.1109/CCC.2010.22ISI: 000286932700015ISBN: 978-0-7695-4060-3 (print)OAI: oai:DiVA.org:kth-63091DiVA: diva2:481617
Conference
25th Annual IEEE Conference on Computational Complexity, Harward Univ, Cambridge, MA, JUN 09-11, 2010
Note
QC 20120202Available from: 2012-01-21 Created: 2012-01-21 Last updated: 2012-02-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Nordström, Jakob

Search in DiVA

By author/editor
Nordström, Jakob
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 31 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf