The following pages link to Proofs as Games (Q2757489):
Displaying 24 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- Parameterized proof complexity (Q451111) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- The intractability of resolution (Q1071750) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- A characterization of tree-like resolution size (Q2444907) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- (Q2816413) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- (Q4989407) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- (Q5092398) (← links)
- (Q5140848) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
