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.

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.

In order to address the increasing number of submissions from a growing variety of topics and with the aim of decreasing the response time of ECCC in general we are currently extending the scientific board.

The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem are based on the arithmetization technique, which transforms a quantified Boolean formula into a related polynomial. The ... more >>>

Properties of Boolean functions on the hypercube that are invariant
with respect to linear transformations of the domain are among some of
the most well-studied properties in the context of property testing.
In this paper, we study a particular natural class of linear-invariant
properties, called matroid freeness properties. These properties ... more >>>

We show that proving results such as BPP=P essentially
necessitate the construction of suitable pseudorandom generators
(i.e., generators that suffice for such derandomization results).
In particular, the main incarnation of this equivalence
refers to the standard notion of uniform derandomization
and to the corresponding pseudorandom generators
(i.e., the standard uniform ... more >>>