Intersection theorems: a potential approach to proof complexity lower bounds
From MaRDI portal
Cites work
- Amortized closure and its applications in lifting for resolution over parities
- Colourful TFNP and propositional proofs
- Equivalence between systems stronger than resolution
- Exponential separation between powers of regular and general resolution over parities
- Intersection classes in TFNP and proof complexity
- Lower bounds for the polynomial calculus
- Separations in proof complexity and TFNP
- Short proofs are narrow—resolution made simple
- Space bounds for resolution
- Space complexity in propositional calculus
- TFNP intersections through the Lens of feasible disjunction
- The complexity of gradient descent: CLS = PPAD pls
- The intractability of resolution
- The relative efficiency of propositional proof systems
This page was built for publication: Intersection theorems: a potential approach to proof complexity lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445514)