SPI-Hub™: Scholarly Publishing Information Hub
Vanderbilt University Medical Center
Thank you for using our scholarly publishing information hub. To help us provide you with quality information, please answer a few questions.
Name:
Electronic Colloquium on Computational Complexity
ISSN(s):
1433-8092(Electronic)
Homepage URL:
Preprints searchable in PubMed?
No
List of disciplines / subjects covered:
Computation models; Computational Complexity; Complexity Bounds; Complexity Trade-Offs; Coding Theory; Combinatorics; Cryptography; Game Theory; Logic; Machine Learning; Optimization; Property Testing; Quantum Computation; Algebraic Complexity; Arithmetic Complexity; Average Case Complexity; Circuit Complexity; Communication Complexity; Data Structure Lower Bounds; Inapproximability; Interactive Proof Systems; Probabilistic Proof Systems; Kolmogorov Complexity; Proof Complexity; Pseudorandomness; Derandomization; Structural Complexity
Topical scope URL:
Start year:
1994
Corporate Sponsors and/or Investors:
Computational Complexity Foundation (CCF)
Website Host:
Weizmann Institute of Science
Platform financial support:
Computational Complexity Foundation (CCF)
Number of records in preprint server:
Not stated