PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Impagliazzo, Russell"

Author of the publication

copydeleteadd this publication to your clipboard
Exponential Lower Bounds for the Pigeonhole Principle.

, , and . Computational Complexity, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Russell Ngo University of Stuttgart

Russell Kajouri University of Stuttgart

 

Other publications of authors with the same name

Homogenization and the polynomial calculus., , , and . Computational Complexity, 11 (3-4): 91-108 (2002)Homogenization and the Polynominal Calculus., , , and . ICALP, volume 1853 of Lecture Notes in Computer Science, page 926-937. Springer, (2000)Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity., , and . ICALP, volume 107 of LIPIcs, page 27:1-27:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution., , and . FOCS, page 604-. IEEE Computer Society, (2002)Lower Bound on Hilbert's Nullstellensatz and propositional proofs, , , , and . FOCS, page 794-806. IEEE Computer Society, (1994)Improved Depth Lower Vounds for Small Distance Connectivity., , and . FOCS, page 692-701. IEEE Computer Society, (1995)Models of greedy algorithms for graph problems., and . SODA, page 381-390. SIAM, (2004)Go with the Winners for Graph Bisection., and . SODA, page 510-520. ACM/SIAM, (1998)Does Looking Inside a Circuit Help?., , , , and . MFCS, volume 83 of LIPIcs, page 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Using Hard Problems to Derandomize Algorithms: An Incomplete Survey.. RANDOM, volume 1269 of Lecture Notes in Computer Science, page 165-173. Springer, (1997)