IEEE
Conference on Computational Complexity

The 24th Conference
July 15th to July 18th, 2009
Paris, France

Announcements

To register, please click on the "Local arrangements" link on the navigation menu to the left.  The web site there also has more details on location and travel.  

The 2010 conference will be in Boston and co-located with STOC 2010. STOC will take place from June 6th to June 8th and CCC will follow on June 9th to June 12th.  More details will appear after the 2009 conference.

Purpose and Scope

This is an annual conference that deals with computational complexity broadly defined. It is usually held sometime between mid-May and mid-July and somewhere in North America or Europe. A call-for-papers is issued each summer by August 1st. Among the topics considered in the scope of the conference are:

• Complexity classes
• Algebraic complexity
• Proof complexity
• Interactive and probabilistic proof systems
• Circuits complexity
• Kolmogorov complexity
• Reducibility and completeness
• Communication complexity
• Inapproximability
• Cryptographic complexity
• Complexity and learning
• Complexity and logic
• Quantum computation
• Average case complexity
• Pseudorandomness and derandomization
• Complexity in other concrete computational models

The conference is sponsored by the IEEE Computer Society Technical Committee for Mathematical Foundations of Computing in cooperation with the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the European Association of Theoretical Computer Science (EATCS).

Web site and Publicity

This is the third version of the CCC web site.  All of the material available on the second version is (or should be) here. The second version is still available but as of December 12th, 2008, is no longer kept up-to-date.  You can still get to the first version from there.

Questions about this web site and/or publicity for CCC should be directed to the John Rogers, the Publicity Chair, by e-mail to the username jrogers at the server cs.depaul.edu.