The following pages link to Russell Impagliazzo (Q202088):
Displaying 18 items.
- (Q5501284) (← links)
- (Q5743451) (← links)
- (Q5750403) (← links)
- Extracting Randomness Using Few Independent Sources (Q5757459) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897756) (← links)
- Derandomizing polynomial identity tests means proving circuit lower bounds (Q5901092) (← links)
- Derandomizing polynomial identity tests means proving circuit lower bounds (Q5916126) (← links)
- Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
- Reducing the complexity of reductions (Q5957724) (← links)
- On the power and limitations of branch and cut (Q6115357) (← links)
- On the pseudo-deterministic query complexity of NP search problems (Q6115399) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- (Q6152159) (← links)
- Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q6483597) (← links)
- TFNP characterizations of proof systems and monotone circuits (Q6610293) (← links)
- Lower bounds for polynomial calculus with extension variables over finite fields (Q6640341) (← links)
- Synergy between circuit obfuscation and circuit minimization (Q6663046) (← links)