Lifting to parity decision trees via stifling
From MaRDI portal
(Redirected from Lifting to parity decision trees via stifling)
Cited in
(10)- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- Exponential separation between powers of regular and general resolution over parities
- One-way communication complexity of partial XOR functions
- Lifting dichotomies
- Lower bounds for regular resolution over parities
- Randomized lifting to semi-structured communication complexity via linear diversity
- Amortized closure and its applications in lifting for resolution over parities
- Direct sums for parity decision trees
- Super-critical trade-offs in resolution over parities via lifting
- Lifting to randomized parity decision trees
This page was built for publication: Lifting to parity decision trees via stifling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610296)