IEEE Conference on Computational Complexity

This conference started as "Structure in Complexity Theory" in 1986. It recently acquired the new name "Conference on Computational Complexity", which was used for the first time in 1996. Topics include:

Complexity classes
Algebraic complexity
Proof complexity
Interactive proof systems
Circuits and other concrete computational models
Kolmogorov complexity
Reducibility
Communication complexity
Complexity and logic
Nonapproximability
Cryptographic complexity
Complexity and learning
Quantum computation

The conference is overseen by a conference committee. Each year, a program committee selects papers to be presented at the conference. More information is available:

Complexity 2002:
- Conference web site: http://www.CRM.UMontreal.CA/CCC
- Call for papers:
- list of accepted papers
- Conference program:
Complexity archives.
Research Abstracts.

The IEEE has requested that we have a charter for the Conference. We intend to vote on a charter at the business meeting of the 2002 conference in Montreal. Please, take a look at the charter.

Created by Luc Longpré,