(mobo import Concept___Events-migrated) |
m (Text replacement - "Submitting link" to "Submission Link") |
||
| Line 6: | Line 6: | ||
|Homepage=https://computationalcomplexity.org/ | |Homepage=https://computationalcomplexity.org/ | ||
|City=Toronto | |City=Toronto | ||
| − | | | + | |Submission Link=https://easychair.org/conferences/?conf=ccc20210 |
|pageCreator=User:Curator 53 | |pageCreator=User:Curator 53 | ||
|pageEditor=User:Curator 53 | |pageEditor=User:Curator 53 | ||
Revision as of 11:56, 17 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
