| 0 | -- | 0 | Bruce E. Litow. Parallel complexity of integer coprimality |
| 0 | -- | 0 | Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. Proof verification and the hardness of approximation problems |
| 0 | -- | 0 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran. The Query Complexity of Program Checking by Constant-Depth Circuits |
| 0 | -- | 0 | Miklós Ajtai. Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions |
| 0 | -- | 0 | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon. Attribute Efficient PAC Learning of DNF with Membership Queries under the Uniform Distribution |
| 0 | -- | 0 | Adam Klivans. Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses |
| 0 | -- | 0 | Madhu Sudan, Luca Trevisan, Salil P. Vadhan. Pseudorandom generators without the XOR Lemma |
| 0 | -- | 0 | Tomoyuki Yamakami, Andrew Chi-Chih Yao. NQP = co-C::=::P |
| 0 | -- | 0 | Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson. Deterministic Amplification of Space Bounded Probabilistic Algorithms |
| 0 | -- | 0 | Itsik Pe er. The median problems for breakpoints are NP-complete |
| 0 | -- | 0 | Rüdiger Reischuk. Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise? |
| 0 | -- | 0 | Luca Trevisan. Recycling Queries in PCPs and in Linearity Tests |
| 0 | -- | 0 | Rüdiger Reischuk. An Average-Case Optimal One-Variable Pattern Language Learner |
| 0 | -- | 0 | Petr Savický. On Random Orderings of Variables for Parity OBDDs |
| 0 | -- | 0 | Paul Beame, Toniann Pitassi. Propositional Proof Complexity: Past, Present and Future |
| 0 | -- | 0 | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra. PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability |
| 0 | -- | 0 | Piotr Berman. On Some Tighter Inapproximability Results, Further Improvements |
| 0 | -- | 0 | Wenceslas Fernandez de la Vega, Marek Karpinski. Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT |
| 0 | -- | 0 | Oded Goldreich. Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK |
| 0 | -- | 0 | Oded Goldreich, Dana Ron, Madhu Sudan. Chinese Remaindering with Errors |
| 0 | -- | 0 | Robert H. Sloan, Ken Takata, György Turán. On frequent sets of Boolean matrices |
| 0 | -- | 0 | Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan. Learning Polynomials with Queries - The Highly Noisy Case |
| 0 | -- | 0 | Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano. The Graph Clustering Problem has a Perfect Zero-Knowledge Proof |
| 0 | -- | 0 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. The Descriptive Complexity Approach to LOGCFL |
| 0 | -- | 0 | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar. A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem |
| 0 | -- | 0 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. Characterizing Small Depth and Small Space Classes by Operators of Higher Types |
| 0 | -- | 0 | Anna Bernasconi. Circuit Complexity of Testing Square-Free Numbers |
| 0 | -- | 0 | Luca Trevisan. Constructions of Near-Optimal Extractors Using Pseudo-Random Generators |
| 0 | -- | 0 | Igor Shparlinski. On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems |
| 0 | -- | 0 | Paul Beame, Jayram S. Thathachar. Time-Space Tradeoffs for Branching Programs |
| 0 | -- | 0 | Boris Hemkemeier. On the decomposition of lattices |
| 0 | -- | 0 | Petr Savický. A probabilistic nonequivalence test for syntactic (1,+k)-branching programs |
| 0 | -- | 0 | Farid M. Ablayev, Svetlana Ablayeva. A Discrete Approximation and Communication Complexity Approach to the Superposition Problem |
| 0 | -- | 0 | Jin-yi Cai. A new transference theorem and applications to Ajtai s connection factor |
| 0 | -- | 0 | Dimitris Fotakis, Paul G. Spirakis. Random Walks, Conditional Hitting Sets and Partial Derandomization |
| 0 | -- | 0 | Irit Dinur, Guy Kindler, Shmuel Safra. Approximating CVP to Within Almost Polynomial Factor is NP-Hard |
| 0 | -- | 0 | Salil P. Vadhan. Extracting All the Randomness from a Weakly Random Source |
| 0 | -- | 0 | Lars Engebretsen. An Explicit Lower Bound for TSP with Distances One and Two |
| 0 | -- | 0 | Detlef Sieling. A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs |
| 0 | -- | 0 | Jiri Sgall. Bounds on Pairs of Families with Restricted Intersections |
| 0 | -- | 0 | Venkatesan Guruswami, Madhu Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes |
| 0 | -- | 0 | Pavel Pudlák. A Note On the Use of Determinant for Proving Lower Bounds on the Size of Linear Circuits |
| 0 | -- | 0 | Stasys Jukna. Combinatorics of Monotone Computations |
| 0 | -- | 0 | Madhu Sudan, Luca Trevisan. Probabilistically checkable proofs with low amortized query complexity |
| 0 | -- | 0 | Farid M. Ablayev. On the Power of Randomized Ordered Branching Programs |
| 0 | -- | 0 | Christoph Meinel, Thorsten Theobald. Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits - a Survey |
| 0 | -- | 0 | Marek Karpinski. On the Computational Power of Randomized Branching Programs |
| 0 | -- | 0 | Johannes Köbler. Average-Case Intractability vs. Worst-Case Intractability |
| 0 | -- | 0 | Vince Grolmusz, Gábor Tardos. Lower Bounds for (MOD p -- MOD m) Circuits |
| 0 | -- | 0 | Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen. Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems |
| 0 | -- | 0 | Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, Luca Trevisan. A tight characterization of NP with 3 query PCPs |
| 0 | -- | 0 | Claus-Peter Schnorr. Security of Allmost ALL Discrete Log Bits |
| 0 | -- | 0 | Mihir Bellare, Oded Goldreich, Erez Petrank. Uniform Generation of NP-witnesses using an NP-oracle |
| 0 | -- | 0 | Dimitris Fotakis. Graph Properties that Facilitate Travelling |
| 0 | -- | 0 | Stasys Jukna, Stanislav Zák. On Branching Programs With Bounded Uncertainty |
| 0 | -- | 0 | Ibrahim Cahit, M. Tezer. Irregular Assignments of the Forest of Paths |
| 0 | -- | 0 | Piotr Berman. On Some Tighter Inapproximability Results |
| 0 | -- | 0 | Paul Beame, Faith E. Fich. On Searching Sorted Lists: A Near-Optimal Lower Bound |
| 0 | -- | 0 | Vikraman Arvind, Jacobo Torán. Sparse Sets, Approximable Sets, and Parallel Queries to NP |
| 0 | -- | 0 | Richard Beigel. Gaps in Bounded Query Hierarchies |
| 0 | -- | 0 | Joseph Cheriyan, Ramakrishna Thurimella. Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching |
| 0 | -- | 0 | Wenceslas Fernandez de la Vega, Marek Karpinski. On Approximation Hardness of Dense TSP and other Path Problems |
| 0 | -- | 0 | Eric Allender, Shiyu Zhou. Uniform Inclusions in Nondeterministic Logspace |
| 0 | -- | 0 | Steffen Reith, Heribert Vollmer. The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae |
| 0 | -- | 0 | Shai Ben-David, Anna Gringauze. On the Existence of Propositional Proof Systems and Oracle-relativized Propositional Logic |
| 0 | -- | 0 | Andris Ambainis, David A. Mix Barrington, Huong LeThanh. On Counting AC:::0::: Circuits with Negative Constants |
| 0 | -- | 0 | Jayram S. Thathachar. On Separating the Read-k-Times Branching Program Hierarchy |
| 0 | -- | 0 | Eric Allender. Isolation, Matching, and Counting |
| 0 | -- | 0 | Martin Sauerhoff. Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs |
| 0 | -- | 0 | Oded Goldreich. Computational Indistinguishability: A Sample Hierarchy |
| 0 | -- | 0 | Daniele Micciancio. The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant |
| 0 | -- | 0 | Valentin E. Brimkov. Lower Bounds, Pseudopolynomial and Approximation Algorithms for the Knapsack Problem with Real Coefficients |
| 0 | -- | 0 | Gunter Blache, Marek Karpinski, Juergen Wirtgen. On Approximation Intractability of the Bandwidth Problem |
| 0 | -- | 0 | Nader H. Bshouty. A New Composition Theorem for Learning Algorithms |
| 0 | -- | 0 | Meena Mahajan, V. Vinay. Determinant: Old Algorithms, New Insights |
| 0 | -- | 0 | Farid M. Ablayev. A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs |
| 0 | -- | 0 | Phong Q. Nguyen, Jacques Stern. A Converse to the Ajtai-Dwork Security Proof and its Cryptographic Implications |
| 0 | -- | 0 | Detlef Sieling. On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization |