Conference on Computational Complexity

Conference on Computational Complexity
Name	Conference on Computational Complexity
Abbreviation	CCC
Discipline	Theoretical computer science
Publisher	Electronic Proceedings in Theoretical Computer Science
Country	International
Established	1986
Frequency	Annual

Conference on Computational Complexity

The Conference on Computational Complexity is an annual Symposium on Theory of Computing-style meeting focused on Computational complexity theory, bringing together researchers from MIT Computer Science and Artificial Intelligence Laboratory, Princeton University, Stanford University, University of California, Berkeley, and other institutions. It fosters interactions among scholars associated with Alan Turing, John von Neumann-inspired models, and contemporary projects at places like Microsoft Research, Google Research, IBM Research, Simons Institute for the Theory of Computing, and Institute for Advanced Study. The conference features work connected to topics related to Karp's 21 NP-complete problems, Cook–Levin theorem, Probabilistically Checkable Proofs, Interactive proof systems, and the P vs NP problem.

Overview

The meeting serves researchers from universities including Harvard University, Yale University, Columbia University, Cornell University, University of Chicago, California Institute of Technology, University of Waterloo, University of Toronto, ETH Zurich, École Polytechnique Fédérale de Lausanne, University of Oxford, University of Cambridge, Imperial College London, University of Edinburgh, Max Planck Institute for Informatics, and research labs like Bell Labs, AT&T Labs Research, Hewlett-Packard Labs, Nokia Bell Labs, and Facebook AI Research. Topics often intersect with work by researchers affiliated with awards such as the Gödel Prize, Turing Award, Neal Koblitz Prize, and institutions like the Royal Society, National Academy of Sciences, American Mathematical Society, and Association for Computing Machinery.

History

The conference was initiated in the mid-1980s by organizers with ties to University of California, San Diego, University of Illinois Urbana-Champaign, Rutgers University, University of Texas at Austin, University of Washington, and Indiana University Bloomington. Early meetings featured results building on the work of Stephen Cook, Richard Karp, Leonid Levin, Michael Rabin, Dana Scott, and Peter Landin. Over time the program included breakthroughs related to Shor's algorithm-adjacent complexity analyses, connections to Quantum computing centers such as IBM Quantum, Google Quantum AI, University of Waterloo's Institute for Quantum Computing, and interdisciplinary collaborations with Princeton Plasma Physics Laboratory and Los Alamos National Laboratory. The venue rotation followed patterns seen at conferences like IEEE FOCS, ACM STOC, SIAM Symposium on Discrete Algorithms, ICALP, CCC Workshops, and regional meetings including Latin American Theoretical Informatics Symposium.

Topics and Scope

Sessions address: circuit lower bounds influenced by Vinod Vaithianathan-style works and historic figures like Leslie Valiant; derandomization connected to Noam Nisan and Madhu Sudan; pseudorandomness inspired by Oded Goldreich, Johan Hastad, Alexei Kitaev; proof complexity following Carsten Lund and Ravi Kannan; parameterized complexity relating to Rod Downey and Michael Fellows; average-case complexity linked to Leonid Levin and Russell Impagliazzo; fine-grained complexity with contributors like Virginia Vassilevska Williams and Erik Demaine; complexity of approximation based on Umesh Vazirani and Sanjeev Arora; quantum complexity connecting to Peter Shor, Lov Grover, John Preskill, and Alexei Kitaev; and descriptive complexity following Neil Immerman and Moshe Vardi. Interactions occur with cryptography communities including Silvio Micali, Ronald Rivest, Adi Shamir, Shafi Goldwasser, Oded Goldreich, and Sanjeev Arora-adjacent work on hardness assumptions such as Learning with Errors. The scope often touches on algorithmic game theory related to Tim Roughgarden and Éva Tardos, as well as interactions with logic traditions from Alonzo Church and Kurt Gödel.

Submission and Review Process

Submission policies mirror practices used by ACM, IEEE, and European Association for Theoretical Computer Science venues, with authors from Carnegie Mellon University, University of Pennsylvania, Johns Hopkins University, Dartmouth College, Brown University, Duke University, University of Illinois Chicago, Purdue University, University of Maryland, College Park, and Northwestern University participating. The program committee typically includes faculty from Technion – Israel Institute of Technology, Tel Aviv University, Weizmann Institute of Science, Seoul National University, Tsinghua University, Peking University, National University of Singapore, Australian National University, and University of Melbourne. Peer review prioritizes novelty, technical correctness, and relevance, following double-blind or single-blind formats similar to NeurIPS, ICML, and IJCAI traditions in some years. Accepted papers are archived in repositories associated with organizations like European Mathematical Society and publishing partners such as Springer and Cambridge University Press in special instances.

Program and Activities

The program features invited talks by recipients of prizes such as the Gödel Prize and Turing Award, tutorials by researchers from Microsoft Research Redmond, Google Research NY, Amazon Research, Meta AI Research, and panel discussions with representatives from National Science Foundation, Deutsche Forschungsgemeinschaft, Engineering and Physical Sciences Research Council, Japan Society for the Promotion of Science, and European Research Council. Workshops co-located with the meeting include specialized events similar to Complexity Theory Meets Quantum Information, summer schools inspired by DIMACS programs, problem sessions echoing Polymath Project collaborations, and poster sessions that attract students from École Normale Supérieure, Kyoto University, Seoul National University, and Indian Institute of Science.

Awards and Recognition

The conference highlights notable contributions with Best Paper Awards, Best Student Paper Awards, and occasionally Lifetime Achievement recognitions reflecting careers at institutions such as Bell Labs, AT&T Bell Laboratories, Microsoft Research Cambridge, and IBM T.J. Watson Research Center. Award-winning research often overlaps with laureates of the Nevalinna Prize, Shaw Prize, Fields Medal cross-disciplinary recipients, and influential articles published in journals like Journal of the ACM, SIAM Journal on Computing, Annals of Mathematics, Communications of the ACM, and Proceedings of the National Academy of Sciences.

Notable Participants and Impact

Prominent attendees have included scholars associated with Princeton University's theoretical groups, alumni of Stanford University and MIT, and researchers from University of California, San Diego and University of California, Los Angeles. The conference has influenced research trajectories at labs including Microsoft Research New England, Google DeepMind, Facebook AI Research, IBM Research Almaden, and startups founded by alumni from Y Combinator-backed ventures. Its proceedings have shaped curricula at departments like Rutgers University, University of Massachusetts Amherst, University of Colorado Boulder, and University of Sydney, and informed policy at funding bodies such as National Science Foundation and European Commission.

Category:Theoretical computer science conferences