Computational Complexity Conference: Difference between revisions
←Created page with '{{Userspace draft|source=ArticleWizard|date=July 2016}} '''CCC''', the '''[http://computationalcomplexity.org Computational Complexity Conference]''', is an ...' |
(No difference)
|
Revision as of 23:01, 4 April 2017
CCC, the Computational Complexity Conference, is an academic conference in the field of theoretical computer science whose roots date to 1986 [1]. It fosters research in "all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints", and is typically held annually between mid-May and mid-July in North America or Europe. As of 2015, CCC is organized independently by the Computational Complexity Foundation (CCF), which provides open access to the proceedings.
History
In 1986 the first "Structure in Complexity Theory Conference" was organized with the support of the US National Science Foundation. As indicated in the call for papers, the conference focused "on the global aspects of computational complexity theory and the structural properties of both complexity classes and complexity-bounded reducibilities", and became known as "Structures". From 1987 through 2014 the conference was sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing. In 1996 the conference broadened its scope to the current one, and accordingly changed its name to "Annual IEEE Conference on Computational Complexity", abbreviated as "CCC". In 2014, after a strong movement towards independence based on a desire for open access to the proceedings, the Computational Complexity Foundation Inc. was established. Starting from 2015 the Foundation organizes the conference independently under the name "Computational Complexity Conference", maintaining the acronym CCC, and publishes its proceedings in the open access venue Leibniz International Proceedings in Informatics (LIPIcs).
Future and past conference websites, as well as past programs and call for papers (going back to 1997), are archived online.
Scope
CCC aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and nonuniform models; Boolean, algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and machine learning. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.
Logistics
CCC is typically held sometime between mid-May and mid-July and somewhere in North America or Europe. The conference usually lasts three to three-and-a-half days with a relatively relaxed schedule. Papers are presented in a single track. There are also often invited speakers. Common evening activities include an opening reception, a rump session consisting of talks about recent breakthroughs and research in progress, and a business meeting that is open to all conference attendees.
Awards
CCC has a tradition of giving a "Best Student Paper Award" for the most outstanding paper written solely by one or more students. As of 2001, a "Best Paper Award" is given to the most outstanding paper submitted to the conference. For each award, the program committee may decide to split the award among two or more papers, or not to present the award at all.