$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing
$k$-Independent Gaussians Fool Polynomial Threshold Functions
$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
(Non-)existence of Polynomial Kernels for the Test Cover Problem
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
2-Sat Sub-Clauses and the Hypernodal Structure of the 3-Sat Problem
2D Electrophoresis Gel Image and Diagnosis of a Disease
3-connected Planar Graph Isomorphism is in Log-space
3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General
3-SAT Polynomial Solution of Knowledge Recognition Algorithm
3-Way Composition of Weighted Finite-State Transducers
A boundary between universality and non-universality in spiking neural P systems
A Casual Tour Around a Circuit Complexity Bound
A Combination of Testability and Decodability by Tensor Products
A comparison of Zeroes and Ones of a Boolean Polynomial
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
A complexity dichotomy for hypergraph partition functions
A complexity dichotomy for partition functions with mixed signs
A Concrete View of Rule 110 Computation
A Counterexample to a Proposed Proof of P=NP by S. Gubin