scientific article; zbMATH DE number 7561756
From MaRDI portal
Publication:5092479
DOI10.4230/LIPIcs.CCC.2020.28MaRDI QIDQ5092479
No author found.
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1912.00534
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular resolution lower bounds for the weak pigeonhole principle
- Resolution proofs of generalized pigeonhole principles
- The intractability of resolution
- Lower bounds for the polynomial calculus
- Resolution lower bounds for the weak functional pigeonhole principle.
- Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games
- Resolution proofs of matching principles
- Resolution lower bounds for perfect matching principles
- Mutilated chessboard problem is exponentially hard for resolution
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
- Width versus size in resolution proofs
- The resolution complexity of independent sets and vertex covers in random graphs
- Space Complexity in Propositional Calculus
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Many hard examples for resolution
- Hard examples for resolution
- Short proofs are narrow—resolution made simple
- Pseudorandom Generators in Propositional Proof Complexity
- Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles
- Clique is hard on average for regular resolution
- Resolution lower bounds for the weak pigeonhole principle
This page was built for publication:
