Cs-Cc
Random subcubes as a toy model for constraint satisfaction problems
Computational Distinguishability of Quantum Channels
On the Parameterised Intractability of Monadic Second-Order Logic
Optimal Tableau Decision Procedures for PDL
Characterizing Polynomial Time Computability of Rational and Real Functions
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
Complexity of Non-Monotonic Logics
On Low Complexity Maximum Likelihood Decoding of Convolutional Codes
General Hardness Amplification of Predicates and Puzzles
An algorithmic complexity interpretation of Lins third law of information theory
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
Complexity of Propositional Proofs under a Promise
Parallelized approximation algorithms for minimum routing cost spanning trees
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
