The Complexity of Boolean Constraint Isomorphism
The Complexity of Clickomania
The Complexity of Computing Minimal Unidirectional Covering Sets
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)
The Complexity of Computing the Size of an Interval
The complexity of conservative finite-valued CSPs
The complexity of conservative valued CSPs
The Complexity of Counting Eulerian Tours in 4-Regular Graphs
The complexity of counting solutions to Generalised Satisfiability Problems modulo k
The Complexity of HCP in Digraps with Degree Bound Two
The Complexity of Iterated Strategy Elimination
The Complexity of Kings
The Complexity of Modified Instances
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
The complexity of multiple-precision arithmetic
The complexity of nonrepetitive edge coloring of graphs
The Complexity of Partition Functions on Hermitian Matrices
The Complexity of Planar Counting Problems
The Complexity of Power-Index Comparison