Curator 20 (talk | contribs) |
Curator 100 (talk | contribs) |
||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
|Acronym=CCC 2020 | |Acronym=CCC 2020 | ||
| − | |Title=Computational Complexity Conference | + | |Title=35th Computational Complexity Conference |
|Ordinal=35 | |Ordinal=35 | ||
| + | |In Event Series=Event Series:CCC | ||
| + | |Single Day Event=no | ||
| + | |Start Date=2020/07/28 | ||
| + | |End Date=2020/07/31 | ||
| + | |Event Status=as scheduled | ||
| + | |Event Mode=online | ||
| + | |Academic Field=Computer Science | ||
| + | |Official Website=https://computationalcomplexity.org/Archive/2020/fullsite/index.php | ||
|Type=Conference | |Type=Conference | ||
| − | |||
| − | |||
|Has coordinator=Markus Bläser | |Has coordinator=Markus Bläser | ||
|has program chair=Shubhangi Saraf | |has program chair=Shubhangi Saraf | ||
| Line 15: | Line 21: | ||
|pageEditor=User:Curator 53 | |pageEditor=User:Curator 53 | ||
|contributionType=1 | |contributionType=1 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Event Deadline | {{Event Deadline | ||
|Submission Deadline=2020/02/17 | |Submission Deadline=2020/02/17 | ||
| + | }} | ||
| + | {{Organizer | ||
| + | |Contributor Type=organization | ||
| + | |Organization=Computational Complexity Foundation | ||
}} | }} | ||
{{Event Metric | {{Event Metric | ||
| Line 40: | Line 44: | ||
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: | 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 | + | *Complexity classes |
| − | * Reducibility and completeness | + | *Reducibility and completeness |
| − | * Circuit complexity | + | *Circuit complexity |
| − | * Communication complexity | + | *Communication complexity |
| − | * Algebraic complexity | + | *Algebraic complexity |
| − | * Proof complexity | + | *Proof complexity |
| − | * Complexity in other concrete computational models | + | *Complexity in other concrete computational models |
| − | * Interactive and probabilistic proof systems | + | *Interactive and probabilistic proof systems |
| − | * Logic and descriptive complexity | + | *Logic and descriptive complexity |
| − | * Pseudorandomness and derandomization | + | *Pseudorandomness and derandomization |
| − | * Average case complexity | + | *Average case complexity |
| − | * Quantum computation | + | *Quantum computation |
| − | * Parametrized complexity | + | *Parametrized complexity |
| − | * Fine-grained complexity | + | *Fine-grained complexity |
| − | * Complexity-theoretic aspects of: | + | *Complexity-theoretic aspects of: |
| − | * coding theory | + | *coding theory |
| − | * cryptography | + | *cryptography |
| − | * optimization (including inapproximability, continuous optimization) | + | *optimization (including inapproximability, continuous optimization) |
| − | * property testing | + | *property testing |
| − | * streaming and sublinear computation | + | *streaming and sublinear computation |
| − | * distributed computation | + | *distributed computation |
| − | * game theory | + | *game theory |
| − | * machine learning | + | *machine learning |
Revision as of 09:00, 10 July 2023
Deadlines
|
||
| Submission |
Metrics
Submitted Papers
101
Accepted Papers
38
Venue
Warning: Venue is missing. The map might not show the exact location.
"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
