Pages that link to "Item:Q2255289"
From MaRDI portal
The following pages link to Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289):
Displaying 11 items.
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- Substitutions into propositional tautologies (Q845921) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- (Q5028364) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- (Q5092479) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
- Propositional proof complexity (Q6064569) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
