Cs-Cc
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
The Computational Power of Minkowski Spacetime
k-Means has Polynomial Smoothed Complexity
Note on Max Lin-2 above Average
A Recursive Definition of the Holographic Standard Signature
The One-Way Communication Complexity of Group Membership
On the complexity of stratified logics
Homogeneous and Non Homogeneous Algorithms
Inapproximability for metric embeddings into R^d
Faster Polynomial Multiplication via Discrete Fourier Transforms
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Radio resource allocation in OFDMA multi-cell networks
