CCC 2018 - 2018 Conference on Computational Complexity
Date2018-06-22 - 2018-06-24
Deadline2018-01-24
VenueSan Diego, California, USA - United States
Keywords
Topics/Call fo Papers
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 contributions from other areas of computer science and mathematics motivated by questions in complexity theory. Possible topics include but are not limited to:
Complexity classes
Reducibility and completeness
Circuit complexity
Communication complexity
Complexity in other discrete models
Algebraic complexity
Proof complexity
Interactive and probabilistic proof systems
Logic and descriptive complexity
Pseudorandomness and derandomization
Average case complexity
Complexity-theoretic aspects of:
coding theory
cryptography
learning theory
optimization (including inapproximability)
property testing
quantum information processing
Complexity classes
Reducibility and completeness
Circuit complexity
Communication complexity
Complexity in other discrete models
Algebraic complexity
Proof complexity
Interactive and probabilistic proof systems
Logic and descriptive complexity
Pseudorandomness and derandomization
Average case complexity
Complexity-theoretic aspects of:
coding theory
cryptography
learning theory
optimization (including inapproximability)
property testing
quantum information processing
Other CFPs
Last modified: 2017-11-05 16:03:17