Logic List Mailing Archive

20th IEEE Conference on Computational Complexity (San Jose CA, June 2005)

IEEE Conference on
Computational Complexity

Sunday, June 12th, to Wednesday, June 15th, 2005, San Jose, California

http://facweb.cs.depaul.edu/jrogers/complexity/

Purpose and Scope

This is an annual conference that deals with computational complexity
broadly defined.  It is usually held sometime between mid-May and mid-July
and somewhere in North America or Europe.  A call-for-papers is issued
each summer by August 1st.  Among the topics considered in the scope of
the conference are:

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

This conference is sponsored by the IEEE Computer Society Technical
Committee on Mathematical Foundations of Computing. The conference is
overseen by a conference committee. Each year, a program committee selects
papers to be presented at the conference.