The complexity of approximate Nash equilibrium in congestion games with negative delays
The Complexity of Approximately Counting Stable Matchings
The Complexity of Approximately Counting Stable Roommate Assignments
The Complexity of Approximating a Bethe Equilibrium
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)
The Complexity of Approximating Bounded-Degree Boolean \sharp CSP
The Complexity of Boolean Constraint Isomorphism
The Complexity of Causality and Responsibility for Query Answers and non-Answers
The complexity of class polynomial computation via floating point approximations
The Complexity of Clickomania
The Complexity of Codiagnosability for Discrete Event and Timed Systems
The Complexity of Computing Minimal Unidirectional Covering Sets
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
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