Calculation of the minimum computational complexity based on information entropy

Can Random Coin Flips Speed Up a Computer?

Can rare SAT formulas be easily recognized? On the efficiency of message passing algorithms for K-SAT at large clause-to-variable ratios

Cell-Probe Lower Bounds for Prefix Sums

Cellular automata and communication complexity

Characterization Of any Non-linear Boolean function Using A Set of Linear Operators

Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra

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