Pages that link to "Item:Q3579188"
From MaRDI portal
The following pages link to Resolution lower bounds for the weak pigeonhole principle (Q3579188):
Displaying 8 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- Mutilated chessboard problem is exponentially hard for resolution (Q1884991) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)