Recommendations
Cites work
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 3614810 (Why is no real title available?)
- scientific article; zbMATH DE number 1223618 (Why is no real title available?)
- scientific article; zbMATH DE number 1256733 (Why is no real title available?)
- scientific article; zbMATH DE number 1304340 (Why is no real title available?)
- scientific article; zbMATH DE number 702472 (Why is no real title available?)
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- scientific article; zbMATH DE number 1559594 (Why is no real title available?)
- scientific article; zbMATH DE number 1361471 (Why is no real title available?)
- scientific article; zbMATH DE number 1424047 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- Hard examples for resolution
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Many hard examples for resolution
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
- Short proofs are narrow -- resolution made simple
- Space complexity in propositional calculus
- The intractability of resolution
Cited in
(40)- On the complexity of resolution with bounded conjunctions
- A combinatorial characterization of treelike resolution space
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems
- scientific article; zbMATH DE number 1424047 (Why is no real title available?)
- The Complexity of Propositional Proofs
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability
- Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
- Towards an optimal separation of space and length in resolution
- Space proof complexity for random 3-CNFs
- Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space
- Total space in resolution is at least width squared
- A simplified way of proving trade-off results for resolution
- On semantic cutting planes with very small coefficients
- Space complexity in propositional calculus
- Cumulative space in black-white pebbling and resolution
- A note about k-DNF resolution
- A tutorial on time and space bounds in tree-like resolution
- A characterization of tree-like resolution size
- The treewidth of proofs
- Trade-offs between time and memory in a tighter model of CDCL SAT solvers
- Total space in resolution
- Reversible pebble games and the relation between tree-like and general resolution space
- Cops-robber games and the resolution of Tseitin formulas
- Autonomous resolution based on DNA strand displacement
- From small space to small width in resolution
- Proofs as Games
- A combinatorial characterization of resolution width
- Space Complexity in Polynomial Calculus
- From small space to small width in resolution
- The depth of resolution proofs
- Supercritical space-width trade-offs for resolution
- Resolution-limited measure and dimension
- On space and depth in resolution
- Hard examples for resolution
- Size-space tradeoffs for resolution
- Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
- A framework for space complexity in algebraic proof systems
- Cliques enumeration and tree-like resolution proofs
- Cops-robber games and the resolution of Tseitin formulas
- Space complexity of random formulae in resolution
This page was built for publication: Space bounds for resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854472)
