Pages that link to "Item:Q2800571"
From MaRDI portal
The following pages link to Lower bounds: from circuits to QBF proof systems (Q2800571):
Displaying 29 items.
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- Relating size and width in variants of Q-resolution (Q1653019) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- How QBF expansion makes strategy extraction hard (Q2096438) (← links)
- Characterising tree-like Frege proofs for QBF (Q2272983) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- Proof complexity of resolution-based QBF calculi (Q2954985) (← links)
- Lower Bound Techniques for QBF Proof Systems (Q3304096) (← links)
- (Q3304106) (← links)
- (Q3384880) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps (Q4635882) (← links)
- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy (Q4651502) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- (Q5028363) (← links)
- (Q5090460) (← links)
- Frege Systems for Quantified Boolean Logic (Q5133965) (← links)
- (Q5136303) (← links)
- Proving Circuit Lower Bounds in High Uniform Classes (Q5417530) (← links)
- Term Rewriting and Applications (Q5703845) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
- Iterated lower bound formulas: a diagonalization-based approach to proof complexity (Q6086997) (← links)
