Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen renewed interest in pebbling in the field of proof complexity. This is a survey of some classical theorems in pebbling, as well as a couple of new ones, with a focus on results that have proven relevant in proof complexity applications
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.