Cs-Cc
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis
Instruction sequences and non-uniform complexity theory
On tiered small jump operators
Considerations on P vs NP
Computation and Dynamics: Classical and Quantum
The Parameterized Complexity of Global Constraints
Approximating acyclicity parameters of sparse hypergraphs
Most tensor problems are NP-hard
Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems
Computability of simple games: A characterization and application to the core
On the Complexity of Matroid Isomorphism Problem
Complexity of Existential Positive First-Order Logic
P versus NP and geometry
Dependency Pairs and Polynomial Path Orders
Breaking Value Symmetry
Holant Problems for Regular Graphs with Complex Edge Functions
On Iterated Dominance, Matrix Elimination, and Matched Paths
Border basis detection is NP-complete
Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation
Unsatisfiable Linear k-CNFs Exist, for every k
Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
