Theory at Berkeley
This is the homepage of the Theory Group in the EECS Department at the University of California, Berkeley. Berkeley is one of the cradles of modern theoretical computer science. Over the last thirty years, our graduate students and, sometimes, their advisors have done foundational work on NP-completeness, cryptography, derandomization, probabilistically checkable proofs, quantum computing, and algorithmic game theory. The mild weather, celebrated eateries (see here and here), and collaborative atmosphere are known to be conducive to great theory-building and problem-solving. In addition, Berkeley's Simons Institute for the Theory of Computing regularly brings together theory-oriented researchers from all over the world to collaboratively work on hard problems. The institute organizes a sequence of programs based on topics (see current & future programs and past ones), supported by workshops (see current & future workshops and past ones) and other events. On Wednesdays, our group comes
Theory at Berkeley You are using an outdated browser. Please upgrade your browser to improve your experience. Theory at Berkeley This is the homepage of the Theory Group in the EECS Department at the University of California, Berkeley . Berkeley is one of the cradles of modern theoretical computer science. Over the last thirty years, our graduate students and, sometimes, their advisors have done foundational work on NP-completeness, cryptography, derandomization, probabilistically checkable proofs, quantum computing, and algorithmic game theory. The mild weather, celebrated eateries (see here
Explore this link on the map →saved by
related reading
- 15-855: Graduate Computational Complexity Theory, Fall 2017cs.cmu.edu
- Computational Complexityblog.computationalcomplexity.org
- What every computer science major should knowmatt.might.net
- ITCS 2024 - Program and Scheduleitcs-conf.org
- Boaz Barakboazbarak.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Computer Sciencearxiv.org
- Complexity class - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- P versus NP problem - Wikipediaen.wikipedia.org
- Tim Roughgarden's Lecture Notestimroughgarden.org
- Ralph Sarkisralphs16.github.io