CCC 2020

CCC 2020
35th Computational Complexity Conference
Event in series	CCC
Dates	2020/07/28 (iCal) - 2020/07/31
Homepage:	https://computationalcomplexity.org/
Location
Location:	Saarbrücken, Online
Loading map... {"minzoom":false,"maxzoom":false,"mappingservice":"leaflet","width":"280px","height":"280px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"wmsoverlay":false,"copycoords":false,"static":false,"zoom":false,"defzoom":14,"layers":["OpenStreetMap"],"overlaylayers":[],"resizable":false,"enablefullscreen":false,"scrollwheelzoom":true,"markercluster":false,"clustermaxzoom":20,"clusterzoomonclick":true,"clustermaxradius":80,"clusterspiderfy":true,"geojson":"","locations":[{"text":"\u003Cb\u003E\u003Cdiv class=\"mw-parser-output\"\u003E\u003C/div\u003E\u003C/b\u003E\u003Chr /\u003E\u003Cdiv class=\"mw-parser-output\"\u003E\u003C/div\u003E","title":"","link":"","lat":49.234362,"lon":6.996379,"icon":""}],"imageoverlays":null}
Important dates
Submissions:	2020/02/17
Papers:	Submitted 101 / Accepted 38 (37.6 %)
Committees
Organizers:	Markus Bläser
PC chairs:	Shubhangi Saraf
Keynote speaker:	Shachar Lovett, Thomas Vidick
Table of Contents

The following coordinate was not recognized: Geocoding failed.

The following coordinate was not recognized: Geocoding failed.

"CCC 2020 was originally scheduled to be held in Saarbrücken, Germany, but due to the public health measures related to Covid-19 in place worldwide, the online format was used instead." - Preface (Proceedings)

Topics

Scope

The conference seeks original research papers in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. We welcome contributions from all topics with connections to or motivated by questions in complexity theory, broadly construed. Papers that expand the reach of complexity theory, or raise important problems that can benefit from the perspective and techniques of computational complexity, are encouraged. 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