Electronic Colloq. on Computational Complexity
Publisher of:
- Color-coding, AloYusZwi-ECCC-94
- Searching constant width mazes captures the AC$^0$-hierarchy, BarLuMil-ECCC-97
- The resolution complexity of random graph $k$-colorability, BeaCulMit-ECCC-04
- 3-coloring in time $O(1.3446^n)$: a no-MIS algorithm, BeiEpp-ECCC-95
- Algorithms for SAT and upper bounds on their complexity, DanHirIva-ECCC-01
- Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning, DobGunMaa-ECCC-94
- Polynomial-time approximation schemes for metric min-sum median clustering, FerKarKen-ECCC-02
- Space efficient algorithms for directed series-parallel graphs, JakLisRei-ECCC-02
- New approximation algorithms for the Steiner tree problems, KarZel-ECCC-95
- 3-SAT $\in RTIME(O(1.32793^n))$: Improving randomized local search by initializing strings of 3-clauses, Rol-ECCC-03
- Clustering for edge-cost minimization, Sch-ECCC-99
