Computational Complexity Conference

CCC'15: Call for Papers

Submission Deadline: Wednesday, November 26, 2014, 7:00pm PST

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. 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
  • Circuit complexity
  • Algebraic complexity
  • Proof complexity
  • Interactive and probabilistic proof systems
  • Complexity in other concrete computational models
  • Reducibility and completeness
  • Logic and descriptive complexity
  • Average case complexity
  • Communication complexity
  • Complexity of optimization, including inapproximability
  • Complexity and cryptography
  • Complexity and learning
  • Complexity and coding theory
  • Complexity and sublinear computation
  • Pseudorandomness and derandomization
  • Quantum computation

Submission

Deadlines: Papers must be submitted electronically via the submission server, and received by November 26, 2014, 7:00pm PST. Notification of acceptance will be sent by February 6, 2015, and final camera-ready copies of accepted papers will be due around mid-March 2015.

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 is considered as supplementary and will be read at the committee's discretion.

Submissions should include proofs of all central claims.

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

Publication

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.

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 under a Creative Commons BY license in the Leibniz International Proceedings in Informatics (LIPIcs) series. Publication in the conference proceedings does not preclude subsequent journal publication.

Awards

Best student paper award: 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. The online submission form contains a check box for authors to indicate that this criterion is satisfied. The program committee may decline to make the award or may split it among several papers. Funding for the best student paper award is provided by EATCS.

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 two or more papers. Authors of papers that receive this award are automatically invited to publish a full version of the paper in the Journal of the ACM .

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 2016 conference, where free hard copies will be distributed.

Conference Information

Dates and location: The conference will be held from June 17th to June 19th, 2015 in Portland, Oregon, USA, as part of the Federated Computing Research Conference (FCRC 2015).

Student travel allowances: In order to defray the costs of attending the conference, some student travel allowances will be offered. More information will be made available on the conference webpage in due time.

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

Program Committee

Board of Trustees

Sponsors

The conference is organized by the Computational Complexity Foundation in cooperation with the European Association for Theoretical Computer Science (EATCS) and with financial backing from the Institute for Quantum Computing (IQC).

Questions?

Please contact Jeff Kinne.

[Last modified 27 Sep 2017 ]

Organized by:

Computational Complexity Foundation Inc.

Part of:

FCRC 2015

In Cooperation with:

EATCS

Supported by:

IQC