Pages that link to "Item:Q408544"
From MaRDI portal
The following pages link to Towards NP-P via proof complexity and search (Q408544):
Displaying 25 items.
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Proof complexity of modal resolution (Q832717) (← 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)
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Proof complexity of monotone branching programs (Q2104254) (← links)
- Characterising tree-like Frege proofs for QBF (Q2272983) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- (Q3304106) (← links)
- (Q4234077) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
- (Q5090460) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- (Q5136303) (← links)
- Automata, Languages and Programming (Q5466529) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
