(mobo import Concept___Events-migrated) |
(mobo import Concept___Fix_Online_Events-migrated) |
||
| Line 7: | Line 7: | ||
|Homepage=https://computationalcomplexity.org/ | |Homepage=https://computationalcomplexity.org/ | ||
|City=Toronto | |City=Toronto | ||
| − | |||
|Paper deadline=2021/02/15 | |Paper deadline=2021/02/15 | ||
|Notification=2021/04/30 | |Notification=2021/04/30 | ||
Revision as of 10:54, 7 September 2022
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
