The following pages link to Russell Impagliazzo (Q202088):
Displaying 50 items.
- The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
- (Q4228469) (← links)
- (Q4228483) (← links)
- (Q4234077) (← links)
- (Q4250219) (← links)
- (Q4251066) (← links)
- (Q4252738) (← links)
- (Q4252755) (← links)
- (Q4258569) (← links)
- A Pseudorandom Generator from any One-way Function (Q4268715) (← links)
- (Q4281540) (← links)
- Size--Depth Tradeoffs for Threshold Circuits (Q4337668) (← links)
- Bounding the Size of Planar Intertwines (Q4377430) (← links)
- (Q4526985) (← links)
- (Q4527042) (← links)
- A Note on Conservativity Relations among Bounded Arithmetic Theories (Q4530148) (← links)
- (Q4549233) (← links)
- Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications (Q4575889) (← links)
- Completeness for First-order Properties on Sparse Structures with Algorithmic Applications (Q4629991) (← links)
- A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution (Q4651510) (← links)
- The effect of random restrictions on formula size (Q4696224) (← links)
- (Q4732126) (← links)
- (Q4737158) (← links)
- (Q4780777) (← links)
- (Q4783716) (← links)
- Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs (Q4892411) (← links)
- New Direct-Product Testers and 2-Query PCPs (Q4910583) (← links)
- (Q4952609) (← links)
- An Entropic Proof of Chang's Inequality (Q4979832) (← links)
- Stabbing planes (Q4993273) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- Fine-grained derandomization: from problem-centric to resource-centric complexity (Q5002697) (← links)
- (Q5091000) (← links)
- (Q5091223) (← links)
- Does Looking Inside a Circuit Help (Q5111215) (← links)
- (Q5121895) (← links)
- (Q5121900) (← links)
- The Surprising Power of Constant Depth Algebraic Proofs (Q5145666) (← links)
- New direct-product testers and 2-query PCPs (Q5172706) (← links)
- An axiomatic approach to algebrization (Q5172767) (← links)
- Pseudorandomness from Shrinkage (Q5244384) (← links)
- Size-depth trade-offs for threshold circuits (Q5248524) (← links)
- Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations (Q5277746) (← links)
- (Q5302082) (← links)
- (Q5351927) (← links)
- Pseudorandomness when the odds are against you (Q5368743) (← links)
- Learning algorithms from natural proofs (Q5368744) (← links)
- On the (im)possibility of obfuscating programs (Q5395678) (← links)
- Time-space tradeoffs in resolution (Q5415477) (← links)
- Strong ETH holds for regular resolution (Q5495819) (← links)
