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

Control Complexity in Bucklin and Fallback Voting

Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime

Correlation/Communication complexity of generating bipartite states

Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

Counting dependent and independent strings

Counting is Easy

Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation