Electronic Colloquium on Computational Complexity information
The Electronic Colloquium on Computational Complexity (ECCC) is an electronic archive of research papers in computational complexity theory, a branch of computer science.[1][2][3]
The intention of the ECCC is to provide a fast publication service intermediate in its level of peer review between preprint servers such as authors' web sites or arXiv (which release papers with little or no delay and filtering) and journals (which subject papers to a heavy editing process but, in computer science, may take months or years to publish a paper). Papers submitted to ECCC are screened by a board of experts, who review the submissions to ensure that they are on-topic, novel, interesting, and written according to the standards of the field. Any panelist may accept or reject any of the submissions; if no decision is made within two months, the submission is automatically rejected.[1][2]
In order to ensure the long-term stability of the archive, its contents are backed up by electronic media that are sent to multiple libraries and to the ECCC board members and by printouts that are stored in multiple locations.[3]
Works in the ECCC remain the copyright of the authors, who may request their removal at any time.[1][2]
The ECCC was founded in 1994 at the University of Trier in Trier, Germany. In 2004 its founding editor Christoph Meinel moved to the Hasso Plattner Institute at the University of Potsdam and moved some of the ECCC offices with him to Potsdam. In January 2017 the ECCC moved to the Weizmann Institute of Science.[4]
After the first ten years of the project, it had accepted more than 900 papers, and had nearly 500 registered users.[3]
^ abcBern, J.; Damm, C.; Meinel, Ch. (1997), "The Electronic Colloquium on Computational Complexity (ECCC): A digital library in use", Research and Advanced Technology for Digital Libraries, Lecture Notes in Computer Science, vol. 1324, Springer-Verlag, pp. 405–421, doi:10.1007/BFb0026741.
^ abcBern, J.; Meinel, Ch.; Sack, H. (1998), "Electronic colloquia: idea and practice", Proceedings of the 16th Annual International Conference on Computer Documentation, ACM SIGDOC, pp. 113–119, doi:10.1145/296336.296364.
^ abcMeinel, Ch.; Klotz, V. (2006), "The first 10 years of the ECCC digital library", Communications of the ACM, 49 (1): 131–134, doi:10.1145/1107458.1107484, S2CID 15216617.
^Goldreich, Oded (2017-05-01). "ECCC relocated to Weizmann Institute". [ECCC/News]. Archived from the original on 2017-01-05.{{cite news}}: CS1 maint: bot: original URL status unknown (link)
and 25 Related for: Electronic Colloquium on Computational Complexity information
2011). "On Sunflowers and Matrix Multiplication". ElectronicColloquiumonComputationalComplexity. TR11-067. Raz, Ran (2002). "On the complexity of matrix...
measurements and the Abelian Stabilizer Problem (Report). ElectronicColloquiumonComputationalComplexity (ECCC). Abrams, Daniel S.; Lloyd, Seth (1999-12-13)...
textbook on the subject, commonly known as the "Blue Book". Also available for download (PDF) at the ElectronicColloquiumonComputationalComplexity.) Zwick...
most directions". ElectronicColloquiumonComputationalComplexity. Sherstov, Alexander A. (2012). "The Communication Complexity of Gap Hamming Distance"...
cryptography, that did not necessarily undergo any refereeing process (yet). arXiv ElectronicColloquiumonComputationalComplexity ePrint Archive v t e v t e...
In computationalcomplexity the decision tree model is the model of computation in which an algorithm is considered to be basically a decision tree, i...
Approximation Algorithm for the Bandwidth Problem on Dense Graphs". ElectronicColloquiumonComputationalComplexity. 4 (17). Minimum bandwidth problem, in: Pierluigi...
transmitted data. Computationalcomplexity theory is a branch of the theory of computation that focuses on classifying computational problems according...
functions in polynomial time". ElectronicColloquiumonComputationalComplexity. ECCC TR05-008. For earlier research on this problem, see: Ma, Keju; von...
PH". ElectronicColloquiumonComputationalComplexity. Gharibian, Sevag; Yirka, Justin (2019). "The complexity of simulating local measurements on quantum...
computability, computationalcomplexity, automata theory and formal languages: CCC - ComputationalComplexity Conference FCT – International Symposium on Fundamentals...
literature focuses instead on the computation of deterministic, rather than random, uncomputable functions. A computational model going beyond Turing machines...
Goldberg and M. Paterson, On counting homomorphisms to directed acyclic graphs, ElectronicColloquiumonComputationalComplexity, Report TR05-121, Oct 2005...
south Asia, the ComputationalComplexity Conference (CCC), held at a different international venue each year, the Symposium onComputational Geometry (SoCG)...
Birkhoff, Dynamical Systems, vol. 9 of the American Mathematical Society Colloquium Publications (Providence, Rhode Island: American Mathematical Society...
Hardness Results for Maximum Weight Rectangles", Proc. 43rd International Colloquiumon Automata, Languages, and Programming: 81:1–81:13, doi:10.4230/LIPIcs...
Piotr; Schnitger, Georg (1992). "On the complexity of approximating the independent set problem". Information and Computation. 96 (1): 77–94. doi:10...
Two significant events occurred in that year: the first was the Turing Colloquium, which was held at the University of Sussex in April, and brought together...
Conjecture true? (more unsolved problems in computer science) In computationalcomplexity theory, the unique games conjecture (often referred to as UGC)...
Global Information