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 welcome contributions from all topics with connections to or motivated by questions in complexity theory, broadly construed. We especially encourage submissions that address complexity-theoretic issues in complexity-adjacent areas such as coding theory, cryptography, game theory, learning, logic and privacy. Possible topics include but are not limited to:

Complexity classes
Reducibility and completeness
Circuit complexity
Communication complexity
Algebraic complexity
Proof complexity
Complexity in other concrete computational models
Interactive and probabilistic proof systems
Logic and descriptive complexity
Pseudorandomness and derandomization
Average case complexity
Quantum computation
Parametrized complexity
Fine-grained complexity
Complexity-theoretic aspects of:
coding theory
cryptography
optimization (including inapproximability, continuous optimization)
property testing
streaming and sublinear computation
distributed computation
game theory
machine learning
privacy