CCC 2013: Call for Papers

Submission Deadline: Friday, November 30, 2012, 17:00 EST


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. We also encourage contributions from other areas of computer science and mathematics motivated by topics in complexity theory. Possible topics include but are not limited to:

  • Complexity classes
  • Algebraic complexity
  • Proof complexity
  • Interactive and probabilistic proof systems
  • Circuit complexity
  • Complexity in other concrete computational models
  • Kolmogorov complexity
  • Logic and descriptive complexity
  • Average case complexity
  • Reducibility and completeness
  • Communication complexity
  • Cryptographic complexity
  • Complexity of optimization, including inapproximability
  • Complexity and learning
  • Complexity and coding theory
  • Complexity and sub-linear computation
  • Pseudorandomness and derandomization
  • Quantum computation


Deadlines: Papers must be submitted electronically, and received by November 30, 2012, 17:00 EST. The submission server is active. The submission deadline has passed. Notification of acceptance will be sent by February 7th, 2013, and final camera-ready copies of accepted papers will be due around mid-March 2013.

Format: Submissions should start with a title page consisting of the title of the paper; each author's name, affiliation, and email address; and an abstract of 1-2 paragraphs summarizing the paper's contributions. A submission must contain within its first 10 pages a clear presentation of the merits of the paper, including discussion of its importance, prior work, and an outline of key technical ideas and methods used to achieve the main claims (similar to the content of a brief oral presentation). There is no bound on the total length of a submission, but material other than the abstract, references, and the first 10 pages may be considered as supplementary and will be read at the committee's discretion.

Submissions are expected to include all ideas necessary for an expert to fully verify the central claims in the paper.

The submission 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 rejection without consideration of their merits. Instructions for formatting camera-ready versions will be communicated to the authors of accepted papers.

Simultaneous submission policy: Material which has been previously published in a journal or another conference proceedings, or which is scheduled for publication prior to June 2013, will not be considered for acceptance.  Simultaneous submission of the same or essentially the same material to another conference with published proceedings is not allowed.

Confidentiality: All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees.


Online posting: Authors are encouraged to post full versions of their submissions in a freely accessible on-line repository such as the Electronic Colloquium on Computational Complexity or the arXiv. It is hoped that authors of accepted papers will make full versions of their papers, with proofs, publicly available by the camera-ready deadline. This should be done in a manner consistent with the IEEE Copyright Policy.

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

Proceedings: 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. Eligible submissions should include the phrase "Eligible for best student paper award" in the "comments to chair" field when submitting. 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 as judged by the program committee. The program committee may decline to make the award or may split it among several papers.

Special journal issue: The program committee will invite full versions of a select number of conference submissions to a special issue of the journal Computational Complexity. The special issue is scheduled to appear by the 2014 conference, where free hard copies will be distributed.

Program Committee

Conference Information

Location and dates: The conference will be held from June 4th to June 7th June 5th to June 7th, 2013 in Palo Alto, California. The conference will partly overlap with the ACM Symposium on Theory of Computing (STOC), also to be held in Palo Alto, from June 1st to June 4th. More information is available on the local arragements webpage.

Student travel grants: In order to defray the costs of attending the conference, some travel awards will be available for students. More information will be made available on the conference webpage in due time.

Visas: A visa to the US may be needed for attending the conference, e.g., for citizens of China, India, and Russia. This website has the exact rules. If a visa is needed, please get in touch with your local US consulate as soon as possible; the whole process may take several months. Feel free to contact the conference organizers if you need a letter to obtain your visa.

Local Arrangements Committee

Conference Steering Committee


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


If you have any questions, please e-mail Jeff Kinne, the publicity chair.

[Last modified 24 May 2018 ]