Pebble Games, Proof Complexity, and Time-Space Trade-offs

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing...

Full description

Bibliographic Details

Published in:	Logical Methods in Computer Science
Main Author:	Jakob Nordstrom
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2013-09-01
Subjects:	computer science - computational complexity computer science - discrete mathematics computer science - logic in computer science mathematics - combinatorics mathematics - logic
Online Access:	https://lmcs.episciences.org/1111/pdf