This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| CCC (Conference on Computational Complexity) | |
|---|---|
![]() | |
| Name | Conference on Computational Complexity |
| Acronym | CCC |
| Discipline | Theoretical computer science |
| Established | 1986 |
| Frequency | Annual |
| Publisher | Springer Dordrecht (Lecture Notes in Computer Science) |
| Country | International |
CCC (Conference on Computational Complexity) The Conference on Computational Complexity is an annual academic conference focused on Computational complexity theory, convening researchers from institutions such as Massachusetts Institute of Technology, Stanford University, Princeton University, University of California, Berkeley, and Carnegie Mellon University. The conference serves as a forum for presenting work related to problems associated with P versus NP problem, NP-completeness, PSPACE, EXPTIME, and related complexity classes studied at organizations including IBM Research, Microsoft Research, Google Research, and Bell Labs. CCC attracts attendees from major labs and universities such as Harvard University, University of Cambridge, University of Oxford, ETH Zurich, and University of Chicago.
CCC focuses on formal models and rigorous proofs concerning resource-bounded computation, bringing together scholars from Courant Institute of Mathematical Sciences, California Institute of Technology, New York University, Yale University, and Columbia University. The program typically includes contributed papers, invited talks, and panels featuring researchers affiliated with École Polytechnique Fédérale de Lausanne, Max Planck Institute for Informatics, Weizmann Institute of Science, Tel Aviv University, and Technion – Israel Institute of Technology. Coverage spans interactions with mathematicians from Institute for Advanced Study, National Institute of Standards and Technology, and contributors from Los Alamos National Laboratory.
CCC was founded in the mid-1980s with founders and early contributors from institutions such as University of Rochester, Rutgers University, Brown University, University of Texas at Austin, and Ohio State University. Early conferences featured work from researchers associated with Bell Labs, AT&T Labs Research, Siemens, NEC, and Hitachi. Over time CCC mirrored developments seen in conferences like STOC, FOCS, ICALP, SODA, and COLT and engaged participants from Royal Society, National Academy of Sciences, Simons Foundation, and Clay Mathematics Institute.
Typical topics at CCC include complexity of decision problems studied alongside results on Interactive proof systems from researchers at Princeton Plasma Physics Laboratory and cryptographic topics paralleling work at RSA Security, IACR, European Research Council, and NSF. Sessions address hardness of approximation with ties to researchers from DIMACS, Bellairs Research Institute, and developments related to Zero-knowledge proofs at University of Waterloo and Northeastern University. Other topics intersect with studies at Los Alamos National Laboratory, Sandia National Laboratories, Lawrence Berkeley National Laboratory, and universities such as Brown University and Duke University.
Conference proceedings have been published in series associated with publishers like Springer, Elsevier, IEEE, and academic outlets used by institutions such as Cambridge University Press and Oxford University Press. Papers often appear subsequently in journals such as Journal of the ACM, SIAM Journal on Computing, Electronic Colloquium on Computational Complexity, and proceedings of meetings organized by American Mathematical Society and Association for Computing Machinery. CCC papers are archived by repositories connected to arXiv, CiteSeerX, DBLP, and databases maintained by Zentralblatt MATH and MathSciNet.
The conference is organized by program committees and steering committees with members drawn from European Research Council, National Science Foundation, Simons Foundation, Gordon and Betty Moore Foundation, and corporations such as Google, Microsoft, IBM, and Amazon. Local organizing committees have been hosted at venues including Cornell University, University of Toronto, University of British Columbia, Tel Aviv University, and ETH Zurich. Funding and awards have involved collaborations with ACM SIGACT, IEEE Computer Society, Simons Institute for the Theory of Computing, and Institute for Pure and Applied Mathematics.
Work presented at CCC has included advances related to foundational results such as separations among complexity classes studied in relation to problems like the Graph Isomorphism problem, circuit complexity influenced by research from Princeton University and CALTECH, and randomness extraction linked to work at Microsoft Research Redmond and Bell Labs. CCC submissions have reported results on derandomization connected to Nisan–Wigderson generator, pseudorandomness themes tied to Håstad's switching lemma, and structural complexity reminiscent of studies by Ladner, Karp, Cook, and Stockmeyer. Influential papers have been connected to researchers affiliated with Stanford Linear Accelerator Center, Harvard John A. Paulson School of Engineering and Applied Sciences, and RIKEN.
CCC participates in the broader theoretical computer science ecosystem alongside conferences and workshops such as STOC, FOCS, ICALP, AISTATS, NeurIPS, PODS, Eurocrypt, Crypto, Asiacrypt, TCC (conference), CSL, and summer schools run by Mathematical Sciences Research Institute, Simons Institute, Banff International Research Station, and Hausdorff Research Institute for Mathematics. The community includes researchers from departments like Department of Mathematics, Princeton University, School of Computer Science, Carnegie Mellon University, and institutes such as Perimeter Institute for Theoretical Physics and Kavli Institute for Theoretical Physics. CCC-related activities often coincide with workshops sponsored by Microsoft Research New England, Google Brain, Facebook AI Research, and collaborations with consortia such as IARPA.
Category:Theoretical computer science conferences