Abstract is missing.
- Short Proofs Are Narrow - Resolution Made Simple (Abstract)Eli Ben-Sasson, Avi Wigderson. 2 [doi]
- On the Complexity of Diophantine Geometry in Low Dimensions (Abstract)J. Maurice Rojas. 3 [doi]
- Pseudorandom Generators without the XOR Lemma (Abstract)Madhu Sudan, Luca Trevisan, Salil P. Vadhan. 4 [doi]
- Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract)Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi. 5 [doi]
- Graph Ramsey Theory and the Polynomial Hierarchy (Abstract)Marcus Schaefer. 6 [doi]
- The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract)Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh. 7 [doi]
- A Lower Bound for PrimalityEric Allender, Michael E. Saks, Igor Shparlinski. 10-14 [doi]
- Non-Automatizability of Bounded-Depth Frege ProofsMaria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi. 15-23 [doi]
- On Monotone Planar CircuitsDavid A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum. 24 [doi]
- Computing from Partial SolutionsAnna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank. 34-45 [doi]
- Proofs, Codes, and Polynomial-Time ReducibilitiesRavi Kumar, D. Sivakumar. 46-53 [doi]
- Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZKOded Goldreich, Salil P. Vadhan. 54 [doi]
- De-Randomizing BPP: The State of the ArtAvi Wigderson. 76 [doi]
- The Complexity of Solving Equations over Finite GroupsMikael Goldmann, Alexander Russell. 80-86 [doi]
- Depth-3 Arithmetic Formulae over Fields of Characteristic ZeroAmir Shpilka, Avi Wigderson. 87 [doi]
- Stronger Separations for Random-Self-Reducibility, Rounds, and AdviceLászló Babai, Sophie Laplante. 98-104 [doi]
- The Expected Size of Heilbronn s TrianglesTao Jiang, Ming Li, Paul M. B. Vitányi. 105-113 [doi]
- Upper Semilattice of Binary Strings with the Relation x is Simple Conditional to y Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin. 114 [doi]
- Gaps in Bounded Query HierarchiesRichard Beigel. 124-141 [doi]
- Query Order and NP-CompletenessJack Jie Dai, Jack H. Lutz. 142-148 [doi]
- Quantum Bounded Query ComplexityHarry Buhrman, Wim van Dam. 149 [doi]
- Some Recent Progress on the Complexity of Lattice ProblemsJin-yi Cai. 158 [doi]
- Deterministic Amplification of Space-Bounded Probabilistic AlgorithmsZiv Bar-Yossef, Oded Goldreich, Avi Wigderson. 188 [doi]
- A Note on the Shortest Lattice Vector ProblemRavi Kumar, D. Sivakumar. 200-204 [doi]
- Applications of a New Transference Theorem to Ajtai s Connection FactorJin-yi Cai. 205-214 [doi]
- Learning DNF by Approximating Inclusion-Exclusion FormulaeJun Tarui, Tatsuie Tsukiji. 215 [doi]
- Circuit Lower Bounds Collapse Relativized Complexity ClassesRichard Beigel, Alexis Maciel. 222-226 [doi]
- Complicated ComplementationsHarry Buhrman, Leen Torenvliet. 227-236 [doi]