Cs-Cc
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
