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:<br>Complexity classes<br>Algebraic complexity<br>Proof complexity<br>Interactive and probabilistic proof systems<br>Circuit complexity<br>Kolmogorov complexity<br>Logic and descriptive complexity<br>Average case complexity<br>Reducibility and completeness<br>Communication complexity<br>Complexity in other concrete computational models<br>Cryptographic complexity<br>Complexity of optimization, including inapproximability<br>Complexity and learning<br>Complexity and coding theory<br>Pseudorandomness and derandomization<br>Complexity and sub–linear computation<br>Quantum computation<br>
Abbrevation
CCC
City
Porto
Country
Portugal
Deadline Paper
Start Date
End Date
Abstract