A combinatorial characterization of treelike resolution space
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256733 (Why is no real title available?)
- scientific article; zbMATH DE number 1445296 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A combinatorial characterization of resolution width
- Hard examples for resolution
- Many hard examples for resolution
- On the relative complexity of resolution refinements and cutting planes proof systems
- Short proofs are narrow—resolution made simple
- Size space tradeoffs for resolution
- Space Complexity in Propositional Calculus
- Space bounds for resolution
- The intractability of resolution
Cited in
(14)- The depth of resolution proofs
- On the complexity of resolution with bounded conjunctions
- A game characterisation of tree-like Q-resolution size
- Reversible pebble games and the relation between tree-like and general resolution space
- A characterization of tree-like resolution size
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems
- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
- Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
- Recursive properties of branching and BGG resolution
- A game characterisation of tree-like Q-resolution size
- Cliques enumeration and tree-like resolution proofs
- scientific article; zbMATH DE number 5119884 (Why is no real title available?)
- A tutorial on time and space bounds in tree-like resolution
- On (simple) decision tree rank
This page was built for publication: A combinatorial characterization of treelike resolution space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014444)
