Pages that link to "Item:Q1887654"
From MaRDI portal
The following pages link to Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654):
Displaying 27 items.
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
- Structures interpretable in models of bounded arithmetic (Q2570136) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Proofs with monotone cuts (Q2888631) (← links)
- FRAGMENTS OF APPROXIMATE COUNTING (Q2921008) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- Abelian groups and quadratic residues in weak arithmetic (Q3566945) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Witnessing matrix identities and proof complexity (Q4634922) (← links)
- (Q5136303) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- Approximate counting in bounded arithmetic (Q5422312) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
