IEEE Computational Complexity Conference, submissions due Dec.3

COMPUTATIONAL COMPLEXITY
Twenty-second Annual IEEE Conference,
June 13th to June 16th, 2007, San Diego, California.

The conference will be part of the Federated Computing
Research Conference (FCRC 2007, see http://www.acm.org/fcrc)
together with fifteen other conferences and workshops,
including STOC 2007.

The conference seeks original research papers in all areas of
computational complexity theory. We also encourage results from
other areas of computer science and mathematics motivated by topics
in complexity theory. Conference proceedings will be published by the
IEEE Computer Society. Publication in the conference proceedings does
not preclude subsequent journal publication. Material which has
been previously published in another conference proceedings or journal
or which is simultaneously submitted to another conference with
published proceedings (including STOC 2007) will not be considered
for acceptance. The following list of possible topics is not exhaustive:

Complexity classes
Algebraic Complexity
Proof complexity
Interactive proof systems
Circuits and other concrete computational models
Kolmogorov complexity
Average case complexity
Reducibility
Communication complexity
Complexity and logic
Nonapproximability
Cryptographic complexity
Complexity and learning
Quantum computation
Derandomization

Program committee:

Rodney Downey, Victoria U. of Wellington
Subhash Khot, Georgia Tech
Adam Klivans, U. of Texas, Austin
Jack Lutz, Iowa State U.
Peter Bro Miltersen (chair), U. of Aarhus
Toniann Pitassi, U. of Toronto
Ronen Shaltiel, U. of Haifa
Mario Szegedy, Rutgers
Thomas Thierauf, Aalen U.
Andrew Chi-Chih Yao, Tsinghua U.

Submission must be received electronically at

http://sigact.acm.org/conference/ccc2007/

by 23:59 EST, December 3rd, 2006, for consideration. See

http://facweb.cs.depaul.edu/jrogers/complexity/cfp.htm and
http://computationalcomplexity.org

for format guidelines and further information about the conference.

.