What we do and why

The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The purpose of this Colloquium is to use electronic media for scientific communication and discussions in the computational complexity community. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, short notes and surveys with

• relevance to the theory of computation,
• clear mathematical profile and
• strictly mathematical format.

Central topics

• models of computation and their complexity,
• trade-off results,
• complexity bounds (with the emphasis on lower bounds).
  Specific areas including complexity issues are
  • combinatorics,
  • communication complexity,
  • cryptography,
  • combinatorial optimization,
  • complexity of learning algorithms,
  • logic.

More reading

Here are some papers on the idea and concept of electronic colloquia and ECCC.

• Christoph Meinel, Volker Klotz
  "The first 10 years of the ECCC digital library"
  Communications of the ACM - CACM, vol. 49, no. 1, pp. 131-134, 2006.
• Jochen Bern, Christoph Meinel, Harald Sack
  "Electronic colloquia: idea and practice"
  ACM Special Interest Group for Design of Communication - SIGDOC, pp. 113-119, 1998.
• Jochen Bern, Carsten Damm, Christoph Meinel "The Electronic Colloquium on Computational Complexity (ECCC): A Digital Library in Use"
  European Conference on Digital Libraries - ECDL, pp. 405-421, 1997.

The collection of all reports published on ECCC in 2010 is now available on DVD. You can order the archive (and also the archive DVDs from earlier years) at the local office.
Please email to eccc@eccc.hpi-web.de for ordering.

With the extension of our scientific board and the implementation of the improved screening mechanism incorporating topics of interest already in the submission process, the ECCC can now provide a clarified Call for Papers.
Please keep in mind, that the ECCC focusses on complexity issues rather than on general algorithmic topics. If you plan to submit, please verify that your work matches the scope of interest defined in the CfP.

We recently modified the ECCC screening mechanism to meet the demand of fast response times of the scientific board. We ask all authors to choose the primary and secondary topics of their papers carefully as we're using this information to decide which editor should review your paper.

We address the following problem: how to execute any algorithm P, for an unbounded number of executions, in the presence of an adversary who observes partial information on the internal state of the computation during executions. The security guarantee is that the adversary learns nothing, beyond P's input/output behavior.

This ... more >>>

We survey research that studies the connection between the computational complexity
of optimization problems on the one hand, and the duality gap between the primal and
dual optimization problems on the other. To our knowledge, this is the first survey that
connects the two very important areas. We further look ... more >>>

We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In particular, we prove the best known lower bound for TSP with ... more >>>