Characterizations of the Existence of Partial and Total One-Way Permutations

Characterizing Polynomial Time Computability of Rational and Real Functions

Chess Pure Strategies are Probably Chaotic

Circuit Lower Bounds, Help Functions, and the Remote Point Problem

Circuit partitions and #P-complete products of inner products

Circuits with arbitrary gates for random operators

Class-based Rough Approximation with Dominance Principle

Classic Nintendo Games are (NP-)Hard

Classical and quantum computation with small space bounds (PhD thesis)

Classical and quantum satisfiability

Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate

Clique in 3-track interval graphs is APX-hard

Clique problem, cutting plane proofs and communication complexity

Closures in Formal Languages and Kuratowski's Theorem

Closures in Formal Languages: Concatenation, Separation, and Algorithms

Cluster Computing and the Power of Edge Recognition

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity

Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example

Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses

Combinatorial invariants for graph isomorphism problem