23-26 June 2008
College Park MD, U.S.A.
The submission server is now open at http://ccc08.cs.washington.edu/.
The deadline is 17:59 PST Dec 6, 2007 (01:59 GMT Dec 7, 2007)
The 23rd IEEE Conference on
Computational Complexity
June 23rd to June 26th, 2008
University of Maryland, College Park
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. The
following list of possible topics is not exhaustive:
Complexity classes Circuit complexity Reducibility
and completeness Communication complexity Proof complexity
Complexity and logic Interactive and probabilistic Pseudorandomness
and
proof systems derandomization
Inapproximability Average case complexity
Complexity in other concrete Algebraic complexity computational
models Complexity and learning Kolmogorov complexity
Cryptographic complexity Quantum computation
The conference is sponsored by the IEEE
Computer Society Technical
Committee for Mathematical Foundations of Computing in cooperation with ACM
SIGACT and EATCS. See http://computationalcomplexity.org for more
details.