Difference between revisions of "CCC 2020"
Jump to navigation
Jump to search
(CSV import conf 2020) |
Tim Holzheim (talk | contribs) (Added page provenance(#264) and contribution type(#271)) |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
|Acronym=CCC 2020 | |Acronym=CCC 2020 | ||
| + | |Title=Computational Complexity Conference | ||
| + | |Ordinal=35 | ||
|Series=CCC | |Series=CCC | ||
| − | | | + | |Type=Conference |
| − | | | + | |Start date=2020/07/28 |
| − | + | |End date=2020/07/31 | |
| − | |End date= | + | |Submission deadline=2020/02/17 |
| − | | | ||
|Homepage=https://computationalcomplexity.org/ | |Homepage=https://computationalcomplexity.org/ | ||
| + | |City=Saarbrücken | ||
| + | |Country=Online | ||
| + | |presence=online | ||
| + | |Has coordinator=Markus Bläser | ||
| + | |has program chair=Shubhangi Saraf | ||
| + | |has Keynote speaker=Shachar Lovett, Thomas Vidick | ||
| + | |Submitted papers=101 | ||
| + | |Accepted papers=38 | ||
| + | |has Proceedings DOI=10.4230/LIPIcs.CCC.2020.0 | ||
| + | |DblpConferenceId=coco/coco2020.html | ||
| + | |wikicfpId=96447 | ||
| + | |ISBN=978-3-95977-156-6 | ||
| + | |pageCreator=Soeren | ||
| + | |pageEditor=Saskia.Ernert | ||
| + | |contributionType=1 | ||
}} | }} | ||
| + | [[GND-ID::1217504117]] | ||
| + | |||
| + | "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 | ||
Latest revision as of 20:16, 1 April 2022
| CCC 2020 | |
|---|---|
Computational Complexity Conference
| |
| Ordinal | 35 |
| Event in series | CCC |
| Dates | 2020/07/28 (iCal) - 2020/07/31 |
| Presence | online |
| Homepage: | https://computationalcomplexity.org/ |
| Location | |
| Location: | Saarbrücken, Online |
| Important dates | |
| Submissions: | 2020/02/17 |
| Papers: | Submitted 101 / Accepted 38 (37.6 %) |
| Committees | |
| Organizers: | Markus Bläser |
| PC chairs: | Shubhangi Saraf |
| Keynote speaker: | Shachar Lovett, Thomas Vidick |
| Table of Contents | |
The following coordinate was not recognized: Geocoding failed.The following coordinate was not recognized: Geocoding failed.
"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