MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Russell Impagliazzo – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

72 documents found, showing 1 through 10. Next 10 →

ATOM

Hard-Core Distributions for Somewhat Hard Problems
by Russell Impagliazzo — 1995 — In 36th Annual Symposium on Foundations of Computer Science
…Hard-core distributions for somewhat hard problems Russell Impagliazzo Computer Science…
Cited by 74 (10 self) – Add To MetaCart

A Tool for Obtaining Tighter Security Analyses of Pseudorandom Function Based Constructions, With Applications to PRP->PRF conversion
by Mihir Bellare, Russell Impagliazzo — 1999
… constructions, with applications to PRP!PRF conversion Mihir Bellare Russell Impagliazzo y February 1999…
Cited by 11 (0 self) – Add To MetaCart

Constant-depth frege systems with counting axioms polynomially simulate nullstellensatz refutations. August 05 2003
by Russell Impagliazzo, Nathan Segerlind — 1998 — Comment
… Refutations Russell Impagliazzo ⋆ and Nathan Segerlind ⋆⋆ Department of Computer Science University…
Cited by 4 (0 self) – Add To MetaCart

Counting axioms do not polynomially simulate counting gates
by Russell Impagliazzo, Nathan Segerlind — 2001 — In Proceedings 42nd Annual Symposium on Foundations of Computer Science
…Counting Axioms Do Not Polynomially Simulate Counting Gates Russell Impagliazzo and Nathan…
Cited by 8 (2 self) – Add To MetaCart

Hill-Climbing Finds Random Planted Bisections
by Ted Carson, Russell Impagliazzo — 2001 — Proc. 12th Symposium on Discrete Algorithms (SODA 01), ACM press, 2001
…Hill-climbing finds random planted bisections Ted Carson and Russell Impagliazzo Computer…
Cited by 9 (1 self) – Add To MetaCart

The Effect of Random Restrictions on Formula Size
by Russell Impagliazzo, Noam Nisan — 1993 — Random Structures and Algorithms, Vol 4, No
…The Effect of Random Restrictions on Formula Size Russell Impagliazzo Noam Nisan y November 3…
Cited by 7 (0 self) – Add To MetaCart

Towards an Analysis of Local Optimization Algorithms
by Tassos Dimitriou, Russell Impagliazzo — 1996 — In Proc. 28th STOC
… Science University of California San Diego, CA 92093-0114 tassos@(email omitted); Russell Impagliazzo…
Cited by 6 (1 self) – Add To MetaCart

Go with the winners for Graph Bisection
by Tassos Dimitriou, Russell Impagliazzo — 1998 — In Proc. 9th SODA, 510{ 520
… Diego, CA 92093-0114 tassos@(email omitted); Russell Impagliazzo 1 Department of Computer Science UC San…
Cited by 1 (0 self) – Add To MetaCart

Computing Planar Intertwines
by Arvind Gupta, Russell Impagliazzo — 1991 — Proc. 1991 Symposium on the Foundations of Computer Science (FOCS '91), IEEE Press
…Computing Planar Intertwines Arvind Gupta Russell Impagliazzo School of Computing Sciences…
Cited by 3 (0 self) – Add To MetaCart

Random CNF's are Hard for the Polynomial Calculus
by Eli Ben-sasson, Russell Impagliazzo — 1999 — In 40th Annual IEEE Symposium on Foundations of Computer Science
… Hebrew University Jerusalem, Israel elli@(email omitted); Russell Impagliazzo Computer Science…
Cited by 18 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB