| 0 | -- | 0 | Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio. On Learning Branching Programs and Small Depth Circuits |
| 0 | -- | 0 | Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio. Learning Multivariate Polynomials from Substitution and Equivalence Queries |
| 0 | -- | 0 | Miklós Ajtai. Generating Hard Instances of Lattice Problems |
| 0 | -- | 0 | Oded Goldreich. Computational Indistinguishability - Algorithms vs. Circuits |
| 0 | -- | 0 | Pierluigi Crescenzi, Riccardo Silvestri. Structure in Approximation Classes |
| 0 | -- | 0 | Miklós Ajtai. A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence |
| 0 | -- | 0 | Sanjeev Khanna. Constraint satisfaction: The approximability of minimization problems |
| 0 | -- | 0 | Martin Dietzfelbinger. The Linear-Array Problem in Communication Complexity Resolved |
| 0 | -- | 0 | Sanjeev Khanna. A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction |
| 0 | -- | 0 | Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener. Optimal attribute-efficient learning of disjunction, parity, and threshold functions |
| 0 | -- | 0 | Bernd Borchert. Looking for an Analogue of Rice s Theorem in Complexity Theory |
| 0 | -- | 0 | Bernd Borchert, Antoni Lozano. Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept |
| 0 | -- | 0 | Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz. A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes |
| 0 | -- | 0 | Dima Grigoriev. Randomized Omega(n:::2:::) Lower Bound for Knapsack |
| 0 | -- | 0 | Oded Goldreich. Property Testing and its connection to Learning and Approximation |
| 0 | -- | 0 | Oded Goldreich. Public-Key Cryptosystems from Lattice Reduction Problems |
| 0 | -- | 0 | Alexander E. Andreev, José D. P. Rolim. Hitting Properties of Hard Boolean Operators and their Consequences on BPP |
| 0 | -- | 0 | Oded Goldreich. The Graph Clustering Problem has a Perfect Zero-Knowledge Proof |
| 0 | -- | 0 | Yosi Ben-Asher. Geometric Approach for Optimal Routing on Mesh with Buses |
| 0 | -- | 0 | Martin Dietzfelbinger. Gossiping and Broadcasting versus Computing Functions in Networks |
| 0 | -- | 0 | Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang. Addition in log::2::n + O(1) Steps on Average: A Simple Analysis |
| 0 | -- | 0 | Petr Savický. A hierarchy for (1,+k)-branching programs with respect to k |
| 0 | -- | 0 | Hans-Jörg Burtschick, Heribert Vollmer. Lindstroem Quantifiers and Leaf Language Definability |
| 0 | -- | 0 | Per Enflo. Stable basis families and complexity lower bounds |
| 0 | -- | 0 | Eric Allender. StUSPACE(log n) is Contained in DSPACE((log:::2:::n)/loglog n) |
| 0 | -- | 0 | Oded Goldreich, Shmuel Safra. A Combinatorial Consistency Lemma with application to the PCP Theorem |
| 0 | -- | 0 | Luca Trevisan. On the Approximability of the Multi-dimensional Euclidean TSP |
| 0 | -- | 0 | Bernd Borchert. Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems |
| 0 | -- | 0 | Yosi Ben-Asher. Optimal Search in Trees |
| 0 | -- | 0 | Edmund Ihler. On polynomial time approximation schemes and approximation preserving reductions |
| 0 | -- | 0 | Oded Goldreich, Shafi Goldwasser, Shai Halevi. Collision-Free Hashing from Lattice Problems |
| 0 | -- | 0 | Oded Goldreich. On the Circuit Complexity of Perfect Hashing |
| 0 | -- | 0 | Thomas Thierauf. The Isomorphismproblem for One-Time-Only Branching Programs |
| 0 | -- | 0 | Shiva Chaudhuri. Deterministic Restrictions in Circuit Complexity |
| 0 | -- | 0 | Carme Àlvarez. A Compendium of Problems Complete for Symmetric Logarithmic Space |
| 0 | -- | 0 | Michael A. Gibson. Efficient Digital to Analog Encoding |
| 0 | -- | 0 | Stasys Jukna. Neither Reading Few Bits Twice nor Reading Illegally Helps Much |
| 0 | -- | 0 | Petr Savický, Stanislav Zák. A large lower bound for 1-branching programs |
| 0 | -- | 0 | Ronald V. Book, Heribert Vollmer, Klaus W. Wagner. Probabilistic Type-2 Operators and Almost -Classes |
| 0 | -- | 0 | Vasken Bohossian. On Neural Networks with Minimal Weights |
| 0 | -- | 0 | Bernd Borchert, Desh Ranjan, Frank Stephan. On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions |
| 0 | -- | 0 | Manindra Agrawal. The Boolean Isomorphism Problem |
| 0 | -- | 0 | Wolfgang Maass. Networks of Spiking Neurons: The Third Generation of Neural Network Models |
| 0 | -- | 0 | Meera Sitharam. Approximation from linear spaces and applications to complexity |
| 0 | -- | 0 | Alexei Kitaev. Quantum measurements and the Abelian Stabilizer Problem |
| 0 | -- | 0 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. Towards efficient constructions of hitting sets that derandomize BPP |
| 0 | -- | 0 | Sanjeev Khanna, Madhu Sudan. The Optimization Complexity of Constraint Satisfaction Problems |
| 0 | -- | 0 | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman. Computing Solutions Uniquely Collapses the Polynomial Hierarchy |
| 0 | -- | 0 | Stasys Jukna. Finite Limits and Monotone Computations |
| 0 | -- | 0 | Wolfgang Maass. The Computational Power of Spiking Neurons Depends on the Shape of the Postsynaptic Potentials |
| 0 | -- | 0 | Eric Allender, Robert Beals, Mitsunori Ogihara. The complexity of matrix rank and feasible systems of linear equations |
| 0 | -- | 0 | Eric Allender. A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy |
| 0 | -- | 0 | Martin Sauerhoff, Ingo Wegener, Ralph Werchner. Optimal Ordered Binary Decision Diagrams for Tree-like Circuits |
| 0 | -- | 0 | Yongge Wang. NP-hard Sets Are Superterse unless NP Is Small |
| 0 | -- | 0 | Carsten Rössner, Claus-Peter Schnorr. An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension |
| 0 | -- | 0 | Manindra Agrawal. An Isomorphism Theorem for Circuit Complexity |
| 0 | -- | 0 | Claus-Peter Schnorr. Security of 2:::t:::-Root Identification and Signatures |
| 0 | -- | 0 | Oded Goldreich. On the Message Complexity of Interactive Proof Systems |
| 0 | -- | 0 | Christoph Meinel. The Log Rank Conjecture for Modular Communication Complexity |
| 0 | -- | 0 | Andrea E. F. Clementi. Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints |
| 0 | -- | 0 | Edoardo Amaldi. On the approximability of some NP-hard minimization problems for linear systems |
| 0 | -- | 0 | Mitsunori Ogihara. Sparse Hard Sets for P Yields Space-Efficient Algorithms |
| 0 | -- | 0 | Mitsunori Ogihara. The PL Hierarchy Collapses |
| 0 | -- | 0 | Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. Visual Cryptography for General Access Structures |
| 0 | -- | 0 | Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith. Sharply Bounded Alternation within P |
| 0 | -- | 0 | Christoph Meinel. An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams |
| 0 | -- | 0 | Manindra Agrawal, Richard Beigel. Modulo Information from Nonadaptive Queries to NP |