Difference between revisions of "CCC 2021"

From OPENRESEARCH fixed Wiki
Jump to navigation Jump to search
(modified through wikirestore by orapi)
(modified through wikirestore by orapi)
Line 1: Line 1:
 
{{Event
 
{{Event
 +
|Acronym=CCC 2021
 +
|Title=Computational Complexity Conference
 +
|Ordinal=36
 +
|Series=CCC
 +
|Type=Conference
 +
|Start date=2021/07/20
 +
|End date=2021/07/23
 
|Submission deadline=2021/02/15
 
|Submission deadline=2021/02/15
 +
|Homepage=https://computationalcomplexity.org/
 +
|City=Toronto
 +
|Country=Online
 +
|presence=online
 
|Paper deadline=2021/02/15
 
|Paper deadline=2021/02/15
 
|Notification=2021/04/30
 
|Notification=2021/04/30
 
|Submitting link=https://easychair.org/conferences/?conf=ccc20210
 
|Submitting link=https://easychair.org/conferences/?conf=ccc20210
|Acronym =CCC 2021
 
|End date=2021-07-23
 
|Series  =CCC
 
|presence=online
 
|Type    =Conference
 
|Country =CA
 
|State  =CA/ON
 
|City    =CA/ON/Toronto
 
|Year    =2021
 
|Homepage=https://computationalcomplexity.org/
 
|Ordinal =36
 
|Start date=2021-07-20
 
|Title  =Computational Complexity Conference
 
 
}}
 
}}
 
Possible topics include but are not limited to:
 
Possible topics include but are not limited to:

Revision as of 09:49, 11 March 2022


Event Rating

median worst
Pain1.svg Pain5.svg

List of all ratings can be found at CCC 2021/rating

CCC 2021
Computational Complexity Conference
Ordinal 36
Event in series CCC
Dates 2021/07/20 (iCal) - 2021/07/23
Presence online
Homepage: https://computationalcomplexity.org/
Submitting link: https://easychair.org/conferences/?conf=ccc20210
Location
Location: Toronto, Online
Loading map...

Important dates
Papers: 2021/02/15
Submissions: 2021/02/15
Notification: 2021/04/30
Table of Contents

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