(mobo import Concept___Events-migrated) |
(mobo import Concept___Events_With_Metrics-migrated) |
||
Line 8: | Line 8: | ||
|Has coordinator=Markus Bläser | |Has coordinator=Markus Bläser | ||
|has program chair=Shubhangi Saraf | |has program chair=Shubhangi Saraf | ||
− | |||
− | |||
|has Proceedings DOI=10.4230/LIPIcs.CCC.2020.0 | |has Proceedings DOI=10.4230/LIPIcs.CCC.2020.0 | ||
|DblpConferenceId=coco/coco2020.html | |DblpConferenceId=coco/coco2020.html | ||
Line 26: | Line 24: | ||
{{Event Deadline | {{Event Deadline | ||
|Submission Deadline=2020/02/17 | |Submission Deadline=2020/02/17 | ||
+ | }} | ||
+ | {{Event Metric | ||
+ | |Number Of Submitted Papers=101 | ||
+ | |Number Of Accepted Papers=38 | ||
}} | }} | ||
{{S Event}} | {{S Event}} |
Revision as of 13:32, 18 October 2022
|
||
Submission |
"CCC 2020 was originally scheduled to be held in Saarbrücken, Germany, but due to the public health measures related to Covid-19 in place worldwide, the online format was used instead." - Preface (Proceedings)
Topics
Scope
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. Papers that expand the reach of complexity theory, or raise important problems that can benefit from the perspective and techniques of computational complexity, are encouraged. 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