ISSN Portal
The Keepers Registry (preservation)
SHERPA/RoMEO (access policies)
wikidata.org
Electronic colloquium on computational complexity
container_lgg4krkydfhmrbwqi75zl3wemi
ECCC
Homepage URLs
http://www.eccc.uni-trier.de/eccc/ |
Example Publications
Finding Primitive Roots Pseudo-Deterministically [article]
Ofer Grossman
2015
|
Electronic colloquium on computational complexity
dblp:journals/eccc/Grossman15
A Note on the computational hardness of evolutionary stable strategies [article]
Noam Nisan
2006
|
Electronic colloquium on computational complexity
dblp:journals/eccc/Nisan06
Resolution Lower Bounds for the Weak Functional Pigeonhole Principle [article]
Alexander A. Razborov
2001
|
Electronic colloquium on computational complexity
dblp:journals/eccc/ECCC-TR01-075
Efficient Communication Establishment in Extremely Unreliable Large Networks [article]
Sotiris E. Nikoletseas, Paul G. Spirakis
2000
|
Electronic colloquium on computational complexity
dblp:journals/eccc/ECCC-TR00-011
A New Look at Some Classical Results in Computational Complexity [article]
Arnaldo Moura, Igor Carboni Oliveira
2009
|
Electronic colloquium on computational complexity
dblp:journals/eccc/MouraO09