m (Text replacement - "Homepage=" to "Official Website=") |
Curator 100 (talk | contribs) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
|Acronym=CCC 2021 | |Acronym=CCC 2021 | ||
| − | |Title=Computational Complexity Conference | + | |Title=36th Computational Complexity Conference |
|Ordinal=36 | |Ordinal=36 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|In Event Series=Event Series:CCC | |In Event Series=Event Series:CCC | ||
|Single Day Event=no | |Single Day Event=no | ||
|Start Date=2021/07/20 | |Start Date=2021/07/20 | ||
| − | |End Date=2021/07/ | + | |End Date=2021/07/22 |
|Event Status=as scheduled | |Event Status=as scheduled | ||
|Event Mode=online | |Event Mode=online | ||
| + | |Academic Field=Computer Science | ||
| + | |Official Website=https://computationalcomplexity.org/Archive/2021/fullsite/index.php | ||
| + | |Submission Link=https://easychair.org/conferences/?conf=ccc20210 | ||
| + | |DOI=10.25798/abs7-y885 | ||
| + | |Type=Conference | ||
| + | |pageCreator=User:Curator 53 | ||
| + | |pageEditor=User:Curator 53 | ||
| + | |contributionType=1 | ||
}} | }} | ||
{{Event Deadline | {{Event Deadline | ||
| + | |Notification Deadline=2021/04/30 | ||
|Paper Deadline=2021/02/15 | |Paper Deadline=2021/02/15 | ||
| − | |||
|Submission Deadline=2021/02/15 | |Submission Deadline=2021/02/15 | ||
}} | }} | ||
| + | {{Organizer | ||
| + | |Contributor Type=organization | ||
| + | |Organization=Computational Complexity Foundation | ||
| + | }} | ||
| + | {{Event Metric}} | ||
{{S Event}} | {{S Event}} | ||
Possible topics include but are not limited to: | 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 |
Latest revision as of 07:10, 11 July 2023
Deadlines
|
||
| Paper |
|
||
| Submission |
|
||
| Notification |
Metrics
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
