posted by system || 2683 views || tracked by 5 users: [display]

CCC 2010 : The 25th IEEE Conference on Computational Complexity


Conference Series : Conference on Computational Complexity
When Jun 9, 2010 - Jun 12, 2010
Where Cambridge, MA, USA
Submission Deadline Dec 15, 2009
Notification Due Feb 25, 2010
Final Version Due Mar 19, 2010
Categories    computation theory   theoretical computer science

Call For Papers

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

Location and Dates

The 2010 conference will be held from June 9th to June 12th, 2010, at Harvard University, located in Cambridge, Massachusetts. The conference will take place immediately after the 42nd ACM Symposium on Theory of Computing (STOC) and will overlap with the 11th ACM Conference on Electronic Commerce (EC), both of which will be held in Cambridge, MA.

See the navigation list for the local arrangements site and to find travel information.

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


Papers must be submitted electronically to A submission must be received by December 15h, 2009, 19:59 EST, for consideration. Notification of acceptance will be sent by February 25th, 2010, and final copies will be due by March 19th, 2010.


A submission consists of a title page (containing the title, author names and affiliations, and an abstract), a body of no more than 10 pages, a bibliography, and possible appendices. The paper should be in single-column format, use at least 11-point font, and have standard margins and spacing between lines. Submissions deviating from these guidelines risk summary rejection. In the body of the paper (i) explain what the major contributions are, (ii) convey why they are interesting, (iii) tell how they relate to prior work, and (iv) present the main ideas behind them. Use appendices to substantiate technical claims. The appendices will be read at the discretion of the
Program Committee. The instructions for the format of final copies will be communicated to the authors of accepted papers.


Material which has been previously published in a journal or another conference proceedings, or which is scheduled for publication prior to July, 2010, will not be considered for acceptance. Simultaneous submission of the same or essentially the same material to a journal or another conference with published proceedings (including STOC) is not allowed. Authors are encouraged to submit their papers to the Electronic Colloquium on Computational Complexity.
Presenting the work

Authors of accepted papers are expected to present their work at the conference. The program committee will determine time allocations for presentations (between 15 and 45 minutes). Conference proceedings will be published by the IEEE Computer Society. Publication in the conference proceedings does not preclude subsequent journal publication.

Ronald V. Book Prize for Best Student Paper

This award will be given to the best paper written solely by one or more students. An abstract is eligible if all authors are full-time students at the time of submission. This should be indicated in the submission registration message or cover letter. The program committee may decline to make the award or may split it among several papers.
Best Paper Award

This award will be given to the best paper submitted to the conference. This will be awarded by the program committee. The program committee may decline to make the award or may split it among several papers.
Program Committee

* Sanjeev Arora, Princeton University
* Stephen Cook, University of Toronto
* Venkatesan Guruswami, Carnegie-Mellon University
* Guy Kindler, Hebrew University
* Meena Mahajan, IMSc, Chennai
* Dieter van Melkebeek (chair), University of Wisconsin
* Omer Reingold, MSR and Weizmann Institute
* Amir Shpilka, Technion
* Emanuele Viola, Northeastern University
* John Watrous, University of Waterloo
* Ronald de Wolf, CWI, Amsterdam

Postable version

A mini-poster version of the CFP is available as a PDF.

If you have any questions, please e-mail John Rogers, the publicity chair. You may also send mail to:

John Rogers
CDM, DePaul University
243 S. Wabash
Chicago IL 60604, USA

Related Resources

SSCI 2019   The 2019 IEEE Symposium Series on Computational Intelligence
LATA 2019   13th International Conference on Language and Automata Theory and Applications
OLDBB-IEEE-CEC 2019   IEEE CEC 2019: Special Session on “Optimization, Learning, and Decision-Making in Bioinformatics and Bioengineering”
Petri Nets 2019   Applications and Theory of Petri Nets
DMOO 2019   IEEE CEC 2019: Special Session on “Dynamic Multi-objective Optimization and its Applications”
COMPLEXIS 2019   3rd International Conference on Complexity, Future Information Systems and Risk
SoCG 2019   Symposium on Computational Geometry
NAACL-HLT 2019   Annual Conference of the North American Chapter of the Association for Computational Linguistics
ACL 2019   57th Annual Meeting of the Association for Computational Linguistics
CCC 2018   Conference on Computational Complexity