Call for Papers Twenty-fifth Annual IEEE Conference on Computational Complexity June 9–12, 2010 Cambridge, Massachusetts

The conference seeks original research papers in all areas of com- Deadlines putational complexity theory, studying the absolute and relative Submission: Dec. 15, 2009, 19:59 EST power of computational models under resource constraints. Typ- Notification: Feb. 25, 2010 ical models include deterministic, nondeterministic, randomized, Final Copy: Mar. 19, 2010 and quantum models; uniform and nonuniform models; Boolean, Program Committee algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, , Princeton U. Stephen Cook, U. of Toronto communication, and entanglement; worst-case as well as average- , CMU case. Other, more specific, topics include: probabilistic and in- Guy Kindler, Hebrew U. teractive proof systems, inapproximability, proof complexity, de- Meena Mahajan, IMSc, Chennai scriptive complexity, and complexity-theoretic aspects of cryp- Dieter van Melkebeek (chair), U. of tography and machine learning. The conference also encourages Wisconsin results from other areas of computer science and mathematics , MSR & Weizmann I. motivated by computational complexity theory. Amir Shpilka, Technion Emanuele Viola, Northeastern U. Submission Papers must be submitted electronically via the John Watrous, U. of Waterloo conference web site at computationalcomplexity.org. The body of Ronald de Wolf, CWI, Amsterdam a submission can be up to 10 pages. Local Organizing Committee Presentation Authors of accepted papers are expected to Scott Aaronson, MIT present their work at the conference. The program committee Steve Homer, Boston U. will allocate slots ranging from 15 to 45 minutes. , MSR (chair), Harvard U. Awards The conference offers awards for the best paper and Emanuele Viola, Northeastern U. the best student paper, as deemed by the program committee.

Conference Committee Publication Conference proceedings will be published by the Scott Aaronson, MIT IEEE Computer Society. This does not preclude subsequent jour- , IIT Kanpur nal publication of extended versions. The program committee Paul Beame, U. of Washington will invite a select number of papers to a special journal issue Johan H˚astad, KTH dedicated to the conference. Pierre McKenzie (past chair), U. of Montr´eal Colocation The conference will take place immediately after Peter Bro Miltersen (chair), U. of the 42nd ACM Symposium on Theory of Computing (STOC) Aarhus and will overlap with the 11th ACM Conference on Electronic John Rogers (publicity), DePaul U. Commerce (EC), both of which will be held in Cambridge, MA. Ronen Shaltiel, U. of Haifa Chris Umans, Caltech More Information See the next page and the conference web site at computationalcomplexity.org. You may also contact the publicity chair, John Rogers . Computational Complexity: Additional Details

Simultaneous Submissions Best Paper Award Material which has been previously published This award will be given to the most outstand- in a journal or another conference proceedings, ing paper among all submissions. The program or which is scheduled for publication prior to committee may decline to make the award or may July 2010 will not be considered for acceptance. split it among several papers. Simultaneous submission of the same or essen- tially the same material to a journal or another Ronald V. Book Prize conference with published proceedings (including This award will be given to the most outstand- STOC) is not allowed. ing submission that is written solely by one or Authors are encouraged to submit their papers more students. A paper is eligible if all authors to the Electronic Colloquium on Computational are full-time students at the time of submission, Complexity at eccc.hpi-web.de/eccc. which should be indicated in the submission reg- istration. The program committee may decline Submission Format Guidelines to make the award or may split it among several A submission consists of a title page (containing papers. the title, author names and affiliations, and an abstract), a body of no more than 10 pages, a Conference Site bibliography, and possible appendices. The pa- The conference will be held on the campus of Har- per should be in single-column format, use at vard University. EC will also be held there, and least 11-point font, and have standard margins STOC at the Hyatt Regency Cambridge. Lodg- and spacing between lines. Submissions deviat- ing options include the STOC hotel, hotels in ing from these guidelines risk summary rejection. Harvard Square, and dormitories on the Harvard In the body of the paper (i) explain what the campus. For more information, see the local ar- major contributions are, (ii) convey why they are rangements website at ccc2010.seas.harvard.edu. interesting, (iii) tell how they relate to prior work, and (iv) present the main ideas behind them. Use Visas appendices to substantiate technical claims. The A visa to the US may be needed for attending the appendices will be read at the discretion of the conference, e.g., for citizens of China, India, and Program Committee. Russia. The web site travel.state.gov/visa has the exact rules. If a visa is needed, please get in touch Final Copy Format Guidelines with your local US consulate as soon as possible; The instructions for final copies will be commu- the whole process may take several months. Feel nicated to the authors of accepted papers. free to contact the conference organizers if you need a letter to obtain your visa. Special Issue The special issue will appear in the journal Com- Sponsors putational Complexity, published by Birkh¨auser. The conference is sponsored by the IEEE Com- It is scheduled to appear by the time of the next puter Society Technical Committee for Mathe- conference. matical Foundations of Computing in coopera- tion with ACM SIGACT and EATCS.