Cs-Cc
Hidden cliques and the certification of the restricted isometry property
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
Incidence Theorems and Their Applications
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover
On the Complexity of Equivalence of Specifications of Infinite Objects
Randomized Distributed Decision
Randomness and Non-determinism
Self-Stabilizing Balancing Algorithm for Containment-Based Trees
Some results on more flexible versions of Graph Motif
Sublogarithmic uniform Boolean proof nets
Sylvester-Gallai type theorems for approximate collinearity
The complexity of finite-valued CSPs
The Complexity of Planar Boolean #CSP with Complex Weights
The Inverse Shapley Value Problem
The mu-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
Three-Element Min-Sol and Conservative Min-Cost-Hom
Turing Minimalism and the Emergence of Complexity
Unshuffling a Square is NP-Hard
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
