The following pages link to Leroy Chew (Q1784952):
Displaying 23 items.
- Understanding cutting planes for QBFs (Q1784953) (← links)
- How QBF expansion makes strategy extraction hard (Q2096438) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Short proofs in QBF expansion (Q2181919) (← links)
- The equivalences of refutational QRAT (Q2181923) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Sorting parity encodings by reusing variables (Q2661327) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- On Unification of QBF Resolution-Based Calculi (Q2922598) (← links)
- (Q2954985) (← links)
- The Complexity of Theorem Proving in Circumscription and Minimal Entailment (Q3192208) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- Are Short Proofs Narrow? QBF Resolution is not Simple. (Q4601867) (← links)
- Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple (Q4608723) (← links)
- (Q4636589) (← links)
- Frege Systems for Quantified Boolean Logic (Q5133965) (← links)
- New Resolution-Based QBF Calculi and Their Proof Complexity (Q5205822) (← links)
- (Q5270089) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)
- Towards uniform certification in QBF (Q6490971) (← links)
- Relating existing powerful proof systems for QBF (Q6572022) (← links)
