CCC 2020

From Openresearch
Revision as of 06:37, 30 July 2026 by Akhilesh (talk | contribs) (Cleaned CCC 2020 with new text {{Event |Acronym=CCC 2020 |Title=35th Computational Complexity Conference |Ordinal=35 |Series=CCC |Type=Conference |Field=Computational complexity theory |Start date=2020/07/28 |End date=2020/07/31 |Submission deadline=2020/02/17 |Homepage=https://computationalcomplexity.org/ |City=Saarbrücken |Country=Online |has program chair=Shubhangi Saraf |Submitted papers=101 |Accepted papers=38 }} "CCC 2020 was originally scheduled to be held in Saarbrücken, Germany, bu...)
Jump to navigation Jump to search
CCC 2020
35th Computational Complexity Conference
Ordinal 35
Type Conference
Field: Computational complexity theory
Event in series CCC
Dates 2020/07/28 (iCal) - 2020/07/31
Homepage: https://computationalcomplexity.org/
Location
Location: Saarbrücken,Online
Important dates
Submissions: 2020/02/17
Bibliographic and retrospective information
Submitted Submitted 101
Accepted Accepted 38
Acceptance rate Acceptance rate 37.6%
Table of Contents



"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