Lower bounds for space in resolution
From MaRDI portal
Recommendations
- Space bounds for resolution
- Space bounds for resolution
- Resolvability of spaces having small spread or extent
- Size-space tradeoffs for resolution
- Maximally resolvable lower density spaces
- Towards an optimal separation of space and length in resolution
- Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space
- scientific article; zbMATH DE number 4178083
- Lower space bounds for randomized computation
- Time-space tradeoffs in resolution, superpolynomial lower bounds for superlinear space
Cited in
(14)- Cops-robber games and the resolution of Tseitin formulas
- Space bounds for resolution
- Reversible pebble games and the relation between tree-like and general resolution space
- A combinatorial characterization of resolution width
- Total space in resolution
- Narrow proofs may be spacious, separating space and width in resolution
- Towards an optimal separation of space and length in resolution
- Space complexity in propositional calculus
- Space bounds for resolution
- An Upper Bound on the Space Complexity of Random Formulae in Resolution
- Space complexity of random formulae in resolution
- On the complexity of resolution with bounded conjunctions (extended abstract).
- Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
- A simplified way of proving trade-off results for resolution
This page was built for publication: Lower bounds for space in resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945238)