Cs-Cc
Spending is not Easier than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
The Exponential Time Complexity of Computing the Probability That a Graph is Connected
First-order transitions and the performance of quantum algorithms in random optimization problems
Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
On tractability and congruence distributivity
Some Tractable Win-Lose Games
Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials
The Complexity of Proving the Discrete Jordan Curve Theorem
Complejidad descriptiva y computacional en maquinas de Turing pequenas
The Equivalence of Sampling and Searching
A General Notion of Useful Information
The Nash Equilibrium Revisited: Chaos and Complexity Hidden in Simplicity
The Power of Depth 2 Circuits over Algebras
The complexity of counting solutions to Generalised Satisfiability Problems modulo k
The $k$-anonymity Problem is Hard
The Asymptotic Normalized Linear Complexity of Multisequences
The Derivational Complexity Induced by the Dependency Pair Method
An Approximation Algorithm for linfty-Fitting Robinson Structures to Distances
Where are the really hard manipulation problems? The phase transition in manipulating the veto rule
New Learning and Testing Problems for Read-Once Functions
Hardness and Algorithms for Rainbow Connectivity
