IEEE Complexity 2011 - IEEE Complexity 2011: IEEE Conference on Computational Complexity

The 26th Conference IEEE
Conference on Computational Complexity

June 8th to June 10th, 2011
Federated Computing Research Conference
San Jose, California

Announcements

The 2010 conference recently concluded. The number of registered participants was one of the largest for the conference. Many thanks to local organizers Salil Vadhan, Scott Aaronson, Steve Homer, Madhu Sudan, and Emanuele Viola.

Next year's conference will be part of the 2011 Federated Computing Research Conference, a collection of 15 overlapping conferences and workshops. FCRC will take place in San Jose, California, and will run from Saturday, June 4th, to Saturday, the 11th. Complexity will run from Wednesday, June 8th, to Friday, the 10th. Local arrangements information, when available, will be found on the FCRC site.

The 2012 conference returns to Europe and will be held in Porto, Portugal. Details will appear when they are determined.

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.

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. 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.

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.