- Randomness vs. Time: Derandomization under a uniform assumption
- Random CNF's are Hard for the Polynomial Calculus Eli BenSasson
- On the (Im)possibility of Obfuscating Programs Boaz Barak y Oded Goldreich y Russell Impagliazzo z Steven Rudich x
- Construction of a pseudorandom generator from any oneway function
- Hardcore distributions for somewhat hard problems Russell Impagliazzo \Lambda
- NearOptimal conversion of Hardness into PseudoRandomness Russell Impagliazzo
- Hillclimbing finds random planted bisections Ted Carson and Russell Impagliazzo \Lambda
- Size--Depth Trade--offs for Threshold Circuits --Extended Russell Impagliazzo \Lambda , Ramamohan Paturi \Lambda , Michael E. Saks y
- Computing Planar Intertwines Arvind Gupta \Lambda Russell Impagliazzo
- Efficient Cryptographic Schemes Provably as Secure as Subset Sum \Lambda
- UNIVERSITY of CALIFORNIA, SAN DIEGO Empirical and Analytic Approaches to Understanding Local Search Heuristics
- The Relative Complexity of NP Search Problems Paul Beame \Lambda
- Upper and Lower Bounds for Treelike Cutting Planes Proofs Russell Impagliazzo Toniann Pitassi \Lambda Alasdair. Urquhart y
- Extracting Randomness Using Few Independent Sources Boaz Barak #
- On the Complexity of Succinct ZeroSum Games (Preliminary Version)
- Computational Complexity Since 1980 Russell Impagliazzo #
- SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics Vol. 39, No. 4, pp. 16371665
- Experimentally Determining Regions of Related Solutions for Graph Bisection Problems
- The Reachability problem for finite cellular automata
- Lower bounds on Hilbert's Nullstellensatz and propositional proofs
- Communication Complexity Towards Lower Bounds on Circuit Depth
- Pseudorandomness for Network Algorithms Russell Impagliazzo \Lambda Noam Nisan y Avi Wigderson z
- Hardness as Randomness : a survey of universal derandomization
- 0022-0000/01 $35.00 2001 Elsevier Science (USA)
- Reducing the Complexity of Reductions Manindra Agrawal \Lambda
- An extended abstract of this paper appears in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. This is the full version.
- Optimal seperation of Treelike and General PRELIMINARY VERSION
- A Switching Lemma for Small Restrictions and Lower Bounds for kDNF Resolution
- A lower bound for DLL algorithms for kSAT (preliminary version)
- Limits on the Provable Consequences of Oneway Permutations.
- The Effect of Random Restrictions on Formula Size
- Improved Depth Lower Bounds for Small Distance Connectivity Paul Beame \Lambda
- Analysis of Hierarchical Markov Chains Ragesh Jaiswal Russell Impagliazzo
- An Axiomatic Approach to Algebrization Russell Impagliazzo
- Towards an analysis of local optimization algorithms Tassos Dimitriou
- A Personal View of AverageCase Complexity Russell Impagliazzo \Lambda
- Relativizing versus Nonrelativizing Techniques: The Role of Local Checkability
- Randomness plays a vital role in almost all areas of computer science, both in theory and in practice. However, the ability to provide high quality random
- Go with the winners for Graph Bisection Tassos Dimitriou 1
- Complexity of kSAT Russell Impagliazzo \Lambda , Ramamohan Paturi y
- Authors' working draft A tool for obtaining tighter security analyses of
- Homogenization and the Polynomial Calculus Josh BureshOppenheim \Lambda