Ran Raz Resolution Lower Bounds for the Weak Pigeonhole Principle. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:3- [Conf]

Eli Ben-Sasson Hard Examples for Bounded Depth Frege. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:4- [Conf]

Uriel Feige Relations between Average Case Complexity and Approximation Complexity. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:5- [Conf]

Jonas Holmerin Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilon. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:6- [Conf]

D. Sivakumar Algorithmic Derandomization via Complexity Theory. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:10- [Conf]

Christopher Umans Pseudo-Random Generators for All Hardnesses. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:11- [Conf]

Paul Beame, Erik Vee Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:18- [Conf]

Subhash Khot On the Power of Unique 2-Prover 1-Round Games. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:25- [Conf]

Alexander A. Razborov Resolution Lower Bounds for Perfect Matching Principles. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:29-38 [Conf]

Stefan S. Dantchev Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:39-43 [Conf]

Frederic Green The Correlation Between Parity and Quadratic Polynomials Mod 3. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:65-72 [Conf]

Eldar Fischer, Ilan Newman Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:73-79 [Conf]

Philipp Woelfel On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:80-89 [Conf]