Under the auspices of the Computational Complexity Foundation (CCF)

WEBSITE > HOME:

#### What we do and why

The Electronic Colloquium on Computational Complexity (ECCC) was established in 1994 as a forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. Posting on the ECCC has the status of a technical report. The Electronic Colloquium on Computational Complexity 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 and trade-offs (with the emphasis on lower bounds).
• complexity theoretic aspects of specific areas including coding theory, combinatorics, cryptography, game theory, logic, machine learning, optimization, property testing, and quantum computation.
For more details see the Call for Papers.

Here are some papers on the idea and concept of electronic colloquia and ECCC.
• Christoph Meinel, Volker Klotz
Communications of the ACM - CACM, vol. 49, no. 1, pp. 131-134, 2006.
• Jochen Bern, Carsten Damm, Christoph Meinel
European Conference on Digital Libraries - ECDL, pp. 405-421, 1997.

5th January 2017 18:30

#### ECCC relocated to Weizmann Institute

The ECCC has just relocated at the Weizmann Institute of Science. The previous locations were first at the University of Trier (1994-2004), and then at the Hasso Plattner Institute (2004-2016).

Our new URL is eccc.weizmann.ac.il, and the previous URL (eccc.hpi-web.de) is supposed to redirect to the new location. All hyperlinks to reports are still functional after the transition.

Our first priority at the next couple of weeks is to verify that the transition has been performed smoothly and that all existing features work as they used to. (Later on and as circumstances permit, we shall perform various minor improvements, which were on our TODO list for a while.)

Please inform Amir Gonen (amir.gonen@weizmann.ac.il), while CCing Oded Goldreich (oded.goldreich@weizmann.ac.il), as soon as you discover anything that does not function as it used to.

At this point, I would like to thank Christoph Meinel, who has been one of the founders of ECCC and served as its chief editor and head of its local office for 23 years. Special thanks also to Christian Willems, who has provided the technical support for the operation of ECCC for the last few years and has supervised the current transition from the sending side. (I am aware that others deserves much credits as well, but regret that I cannot provide the relevant details at this time. Providing a full account of the history of the establishing of ECCC and its operation since 1994, in the form of a "History of ECCC" page, is on our TODO list.)

Lastly, many thanks to Amir Gonen for performing the transition on the receiving side and for agreeing to undertake the operation from this point on.

Oded Goldreich

23rd December 2016 12:53

#### ECCC moves to Weizmann Institute

After 23 years of running the ECCC, first at the University of Trier, then at the Hasso Plattner Institute, the ECCC will find a new home at the Weizmann Institute.

This smooth transition will happen with the beginning of 2017. We will keep you informed upfront.

4th March 2016 14:00

#### ECCC Archive DVD 2015

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

-> Older news
Latest Report Titles
TR18-101 | 20th May 2018
Akash Kumar, C. Seshadhri, Andrew Stolman

#### Finding forbidden minors in sublinear time: a $O(n^{1/2+o(1)})$-query one-sided tester for minor closed properties on bounded degree graphs

Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\varepsilon n$ edges from $G$ to make it $H$-minor free (for some small constant $\varepsilon > 0$).
We give an $n^{1/2+o(1)}$-time randomized procedure that, with high probability, finds an ... more >>>

TR18-100 | 18th May 2018
Eshan Chattopadhyay, Anindya De, Rocco Servedio

#### Simple and efficient pseudorandom generators from Gaussian processes

We show that a very simple pseudorandom generator fools intersections of $k$ linear threshold functions (LTFs) and arbitrary functions of $k$ LTFs over $n$-dimensional Gaussian space.

The two analyses of our PRG (for intersections versus arbitrary functions of LTFs) are quite different from each other and from previous analyses of ... more >>>

TR18-099 | 19th May 2018
Scott Aaronson

#### PDQP/qpoly = ALL

We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable ... more >>>

-> Older reports

ISSN 1433-8092 | Imprint