Pages that link to "Item:Q5311724"
From MaRDI portal
The following pages link to Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds (Q5311724):
Displaying 13 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Substitutions into propositional tautologies (Q845921) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Hardness assumptions in the foundations of theoretical computer science (Q2388429) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- (Q5028364) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
