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...

Descrición completa

Detalles Bibliográficos

Autor Principal:	Jakob Nordstrom
Formato:	Artigo
Idioma:	Inglês
Publicado:	Logical Methods in Computer Science e.V. 2013-09-01
Series:	Logical Methods in Computer Science
Assuntos:	computer science - computational complexity computer science - discrete mathematics computer science - logic in computer science mathematics - combinatorics mathematics - logic
Acceso en liña:	https://lmcs.episciences.org/1111/pdf
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!