Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

Computing Multi-Homogeneous Bezout Numbers is Hard

Computing Multiplicities of Lie Group Representations

Computing Nash Equilibria: Approximation and Smoothed Complexity

Computing over the Reals: Foundations for Scientific Computing

Computing the Solutions of the Combined Korteweg-de Vries Equation by Turing Machines

Computing without memory

Concurrent Knowledge-Extraction in the Public-Key Model

Conditional Hardness for Approximate Coloring

Confronting Intractability via Parameters

Considerations on P vs NP

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems

Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations

Constraint Optimization and Statistical Mechanics

Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets

Constraint Satisfaction with Counting Quantifiers

Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable

Construction of an NP Problem with an Exponential Lower Bound

Construction of regular languages and recognizability of polynomials

Constructive Dimension and Turing Degrees