Space complexity in propositional calculus
From MaRDI portal
Recommendations
Cited in
(12)- Space bounds for resolution
- On the complexity of resolution with bounded conjunctions
- A framework for space complexity in algebraic proof systems
- Space complexity in polynomial calculus
- scientific article; zbMATH DE number 6482141 (Why is no real title available?)
- Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems
- Space Complexity in Propositional Calculus
- Space complexity of random formulae in resolution
- Computability and complexity results for a spatial assertion language for data structures
- Computer Science Logic
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
- Intersection theorems: a potential approach to proof complexity lower bounds
This page was built for publication: Space complexity in propositional calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192004)