Cops-Robber Games and the Resolution of Tseitin Formulas
- 26 June 2018
- book chapter
- Published by Springer Nature
- p. 311-326
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear SpaceSIAM Journal on Computing, 2016
- Some trade-off results for polynomial calculus2013
- Satisfiability, Branch-Width and Tseitin tautologiescomputational complexity, 2011
- An annotated bibliography on guaranteed graph searchingTheoretical Computer Science, 2008
- Marshals, monotone marshals, and hypertree‐widthJournal of Graph Theory, 2004
- A combinatorial characterization of resolution width2004
- Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree widthJournal of Computer and System Sciences, 2003
- Space Bounds for ResolutionInformation and Computation, 2001
- Short proofs are narrow—resolution made simpleJournal of the ACM, 2001
- The Vertex Separation and Search Number of a GraphInformation and Computation, 1994