m (Text replacement - "Submitting link" to "Submission Link") |
m (Text replacement - "Homepage=" to "Official Website=") |
||
Line 4: | Line 4: | ||
|Ordinal=36 | |Ordinal=36 | ||
|Type=Conference | |Type=Conference | ||
− | | | + | |Official Website=https://computationalcomplexity.org/ |
|City=Toronto | |City=Toronto | ||
|Submission Link=https://easychair.org/conferences/?conf=ccc20210 | |Submission Link=https://easychair.org/conferences/?conf=ccc20210 |
Revision as of 13:01, 19 October 2022
Deadlines
|
||
Submission |
|
||
Paper |
|
||
Notification |
Venue
Warning: Venue is missing. The map might not show the exact location.
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