WEBSITE > HOME:

#### 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,
• 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.

Here are some papers on the idea and concept of electronic colloquia and ECCC.
6th March 2012 12:04

#### ECCC Archive DVD 2011

In 2011 we had a total count of 174 published reports on ECCC. The collection of all the reports from 2011 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.

9th March 2011 09:41

#### ECCC Archive DVD 2010

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.

8th April 2010 10:10

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.

-> Older news
TR13-074 | 9th May 2013
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

#### Helly Circular-Arc Graph Isomorphism is in Logspace

We present logspace algorithms for the canonical labeling problem and the representation problem of Helly circular-arc (HCA) graphs. The first step is a reduction to canonical labeling and representation of interval intersection matrices. In a second step, the Delta trees employed in McConnell's linear time representation algorithm for interval matrices ... more >>>

TR13-073 | 14th May 2013
Oded Goldreich

#### On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

A couple of years ago, Blais, Brody, and Matulef put forward a methodology for proving lower bounds on the query complexity
of property testing via communication complexity. They provided a restricted formulation of their methodology
(via simple combining operators'')
and also hinted towards a more general formulation, which we spell ... more >>>

TR13-072 | 3rd May 2013
Jan Johannsen

#### Exponential Separations in a Hierarchy of Clause Learning Proof Systems

Resolution trees with lemmas ($\mathrm{RTL}$) are a resolution-based propositional proof system that is related to the DPLL algorithm with clause learning. Its fragments $\mathrm{RTL}(k)$ are related to clause learning algorithms where the width of learned clauses is bounded by $k$.

For every $k$ up to $O(\log n)$, an exponential separation ... more >>>

-> Older reports

ISSN 1433-8092 | Imprint