| 0 | -- | 0 | Ziv Bar-Yossef. Sampling Lower Bounds via Information Theory |
| 0 | -- | 0 | Bruce E. Litow. Polynomial equation elimination via Tarski Algebra |
| 0 | -- | 0 | Eran Halperin, Guy Kortsarz, Robert Krauthgamer. Tight lower bounds for the asymmetric k-center problem |
| 0 | -- | 0 | Arnold Beckmann. Height restricted constant depth LK |
| 0 | -- | 0 | Meir Feder, Dana Ron, Ami Tavory. Bounds on Linear Codes for Network Multicast |
| 0 | -- | 0 | Andreas Björklund, Thore Husfeldt, Sanjeev Khanna. Approximating Longest Directed Path |
| 0 | -- | 0 | Birgit Schelm. Average-Case Complexity Theory of Approximation Problems |
| 0 | -- | 0 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich. Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques |
| 0 | -- | 0 | Philippe Moser. BPP has effective dimension at most 1/2 unless BPP=EXP |
| 0 | -- | 0 | Olivier Powell. PSPACE contains almost complete problems |
| 0 | -- | 0 | Christian Glaßer, Alan L. Selman, Samik Sengupta. Reductions between Disjoint NP-Pairs |
| 0 | -- | 0 | Janka Chlebíková, Miroslav Chlebík. Inapproximability results for bounded variants of optimization problems |
| 0 | -- | 0 | Kristoffer Arnsfelt Hansen. Constant width planar computation characterizes ACC0 |
| 0 | -- | 0 | Till Tantau. Weak Cardinality Theorems for First-Order Logic |
| 0 | -- | 0 | Anna Palbom. On Spanning Cacti and Asymmetric TSP |
| 0 | -- | 0 | Piotr Berman, Marek Karpinski, Alex D. Scott. Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT |
| 0 | -- | 0 | Mikhail N. Vyalyi. QMA=PP implies that PP contains PH |
| 0 | -- | 0 | Elad Hazan, Shmuel Safra, Oded Schwartz. On the Hardness of Approximating k-Dimensional Matching |
| 0 | -- | 0 | Eli Ben-Sasson, Oded Goldreich, Madhu Sudan. Bounds on 2-Query Codeword Testing |
| 0 | -- | 0 | Matthias Galota, Heribert Vollmer. Functions Computable in Polynomial Space |
| 0 | -- | 0 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener. On Converting CNF to DNF |
| 0 | -- | 0 | Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. FIFO is Unstable at Arbitrarily Low Rates |
| 0 | -- | 0 | Shafi Goldwasser, Yael Tauman. On the (In)security of the Fiat-Shamir Paradigm |
| 0 | -- | 0 | Avrim Blum, Ke Yang. On Statistical Query Sampling and NMR Quantum Computing |
| 0 | -- | 0 | Luca Trevisan. An epsilon-Biased Generator in NC0 |
| 0 | -- | 0 | Edward A. Hirsch, Arist Kojevnikov. Several notes on the power of Gomory-Chvatal cuts |
| 0 | -- | 0 | Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang. Disjoint NP-Pairs |
| 0 | -- | 0 | Sven Baumer, Rainer Schuler. Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs |
| 0 | -- | 0 | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey. Private Computation - k-connected versus 1-connected Networks |
| 0 | -- | 0 | Piotr Berman, Marek Karpinski. Improved Approximation Lower Bounds on Small Occurrence Optimization |
| 0 | -- | 0 | Olivier Dubois, Yacine Boufkhad, Jacques Mandler. Typical random 3-SAT formulae and the satisfiability threshold |
| 0 | -- | 0 | Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova. 3CNF Properties are Hard to Test |
| 0 | -- | 0 | Scott Aaronson. Quantum Certificate Complexity |
| 0 | -- | 0 | Eli Ben-Sasson, Prahladh Harsha. Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games |
| 0 | -- | 0 | Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi. DPLL with Caching: A new algorithm for #SAT and Bayesian Inference |
| 0 | -- | 0 | Stefan Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable |
| 0 | -- | 0 | Vince Grolmusz. Near Quadratic Matrix Multiplication Modulo Composites |