The conference seeks original research papers in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. We also encourage results from other areas of computer science and mathematics motivated by topics in complexity theory. The following list of possible topics is not exhaustive:

Complexity classes
Algebraic complexity
Proof complexity
Interactive and probabilistic proof systems
Circuit complexity
Kolmogorov complexity
Logic and descriptive complexity
Average case complexity
Reducibility and completeness
Communication complexity
Complexity in other concrete computational models
Cryptographic complexity
Complexity of optimization, including inapproximability
Complexity and learning
Complexity and coding theory
Pseudorandomness and derandomization
Complexity and sub-linear computation
Quantum computation

Conference Location and Dates

The 2012 conference will be held from June 26th to June 29th, 2012, in Porto, Portugal, and is organized in association with the 2012 Alan Turing Year. In order to defray the costs of attending an overseas conference, some travel awards are available for students from US institutions. More information about travel and local arrangements will be made available on the conference webpage in due time.