| 0 | -- | 0 | Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit. The Computational Complexity of Some Problems of Linear Algebra |
| 0 | -- | 0 | Noam Nisan, Ziv Bar-Yossef. Pointer Jumping Requires Concurrent Read |
| 0 | -- | 0 | Stasys Jukna. Exponential Lower Bounds for Semantic Resolution |
| 0 | -- | 0 | Eli Biham, Dan Boneh, Omer Reingold. Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring |
| 0 | -- | 0 | Manindra Agrawal. The Satisfiability Problem for Probabilistic Ordered Branching Programs |
| 0 | -- | 0 | Marco Cesati, Miriam Di Ianni. Parameterized Parallel Complexity |
| 0 | -- | 0 | Jin-yi Cai. Approximating the SVP to within a factor (1 + 1/dim:::epsilon:::) is NP-hard under randomized reductions |
| 0 | -- | 0 | Oded Goldreich. Notes on Levin s Theory of Average-Case Complexity |
| 0 | -- | 0 | Petr Savický. Complexity and Probability of some Boolean Formulas |
| 0 | -- | 0 | Oded Goldreich. Combinatorial Property Testing (a survey). |
| 0 | -- | 0 | Bruce E. Litow. A Decision Method for the Rational Sequence Problem |
| 0 | -- | 0 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin. Arthur-Merlin Games in Boolean Decision Trees |
| 0 | -- | 0 | Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim. Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs |
| 0 | -- | 0 | Wolfgang Maass. Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages |
| 0 | -- | 0 | Wolfgang Maass. On the Effect of Analog Noise in Discrete-Time Analog Computations |
| 0 | -- | 0 | Stanislav Zák. A subexponential lower bound for branching programs restricted with regard to some semantic aspects |
| 0 | -- | 0 | Moni Naor. On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited |
| 0 | -- | 0 | Wolfgang Maass. On the Complexity of Learning for Spiking Neurons with Temporal Coding |
| 0 | -- | 0 | Søren Riis. Non-constant Degree Lower Bounds imply linear Degree Lower Bounds |
| 0 | -- | 0 | Miklós Ajtai. The Shortest Vector Problem in L::2:: is NP-hard for Randomized Reductions |
| 0 | -- | 0 | Alexander Barg. Complexity Issues in Coding Theory |
| 0 | -- | 0 | Oded Goldreich. Another proof that BPP subseteq PH (and more). |
| 0 | -- | 0 | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum. Searching constant width mazes captures the AC:::0::: hierarchy |
| 0 | -- | 0 | Bruno Codenotti, Pavel Pudlák, Giovanni Resta. Some structural properties of low rank matrices related to computational complexity |
| 0 | -- | 0 | Russell Impagliazzo, Pavel Pudlák, Jiri Sgall. Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm |
| 0 | -- | 0 | Marek Karpinski. On Approximation Hardness of the Bandwidth Problem |
| 0 | -- | 0 | Dorit Dor, Shay Halperin, Uri Zwick. All Pairs Almost Shortest Paths |
| 0 | -- | 0 | Marek Karpinski, Alexander Zelikovsky. Approximating Dense Cases of Covering Problems |
| 0 | -- | 0 | Pierluigi Crescenzi. MAX NP-Completeness Made Easy |
| 0 | -- | 0 | Johan Håstad. Clique is hard to approximate within n:::1-epsilon::: |
| 0 | -- | 0 | Johan Håstad. Some optimal inapproximability results |
| 0 | -- | 0 | Meena Mahajan, V. Vinay. Determinant: Combinatorics, Algorithms, and Complexity |
| 0 | -- | 0 | Richard Chang. Bounded Queries, Approximations and the Boolean Hierarchy |
| 0 | -- | 0 | Jui-Lin Lee. Counting in Uniform TC:::0::: |
| 0 | -- | 0 | Meena Mahajan, Venkatesh Raman. Parametrizing Above Guaranteed Values: MaxSat and MaxCut |
| 0 | -- | 0 | Jan Johannsen. Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes |
| 0 | -- | 0 | Oded Goldreich, Shafi Goldwasser. On the Limits of Non-Approximability of Lattice Problems |
| 0 | -- | 0 | Martin Sauerhoff. On Nondeterminism versus Randomness for Read-Once Branching Programs |
| 0 | -- | 0 | Sanjeev Arora, Madhu Sudan. Improved low-degree testing and its applications |
| 0 | -- | 0 | Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger. On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations |
| 0 | -- | 0 | Scott E. Decatur, Oded Goldreich, Dana Ron. Computational Sample Complexity |
| 0 | -- | 0 | Johannes Merkle, Ralph Werchner. On the Security of Server aided RSA protocols |
| 0 | -- | 0 | Jochen Meßner, Jacobo Torán. Optimal proof systems for Propositional Logic and complete sets |
| 0 | -- | 0 | Harald Hempel, Gerd Wechsung. The Operators min and max on the Polynomial Hierarchy |
| 0 | -- | 0 | Marek Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems |
| 0 | -- | 0 | Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener. On P versus NP /cap co-NP for Decision Trees and Read-Once Branching Programs |
| 0 | -- | 0 | Gunnar Andersson. Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat |
| 0 | -- | 0 | Farid M. Ablayev. Randomization and nondeterminsm are incomparable for ordered read-once branching programs |
| 0 | -- | 0 | Oded Goldreich. A Sample of Samplers - A Computational Perspective on Sampling (survey) |
| 0 | -- | 0 | Richard Beigel, Alexis Maciel. Upper and Lower Bounds for Some Depth-3 Circuit Classes |
| 0 | -- | 0 | Martin Sauerhoff. A Lower Bound for Randomized Read-k-Times Branching Programs |
| 0 | -- | 0 | Oded Goldreich, Shafi Goldwasser, Shai Halevi. Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem |
| 0 | -- | 0 | Marek Karpinski, Juergen Wirtgen, Alexander Zelikovsky. An Approximation Algorithm for the Bandwidth Problem on Dense Graphs |
| 0 | -- | 0 | Manindra Agrawal, Eric Allender, Samir Datta. On TC:::0:::, AC:::0:::, and Arithmetic Circuits |
| 0 | -- | 0 | Jan Krajícek. Interpolation by a Game |
| 0 | -- | 0 | Klaus Reinhardt, Eric Allender. Making Nondeterminism Unambiguous |
| 0 | -- | 0 | Bernd Borchert, Dietrich Kuske, Frank Stephan. On Existentially First-Order Definable Languages and their Relation to NP |
| 0 | -- | 0 | Luca Trevisan. On Local versus Global Satisfiability |
| 0 | -- | 0 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan. Weak Random Sources, Hitting Sets, and BPP Simulations |
| 0 | -- | 0 | Marcos A. Kiwi. Testing and Weight Distributions of Dual Codes |
| 0 | -- | 0 | Marco Cesati. On the Efficiency of Polynomial Time Approximation Schemes |