Researchers have proposed various techniques for investigating the limits of computation, many of which have been sharpened in depth during the last two decades. We may soon be entering the stage of expecting some big breakthrough results toward understanding the limits of computation.
In this project, we investigate these techniques and relationships among them with the goal of finding the next steps toward a big breakthrough. We welcome researchers working on subjects related to computational complexity theory to join us for various occasions.
- February 10, 2014SODA Debriefing Session was held.
- January 26, 2014ELC Workshop on Inapproximability (1/25 – 1/26) was held.
- December 23, 2013FOCS Debriefing Session (12/23 – 1/24) was held.
- December 17, 2013ELC Seminar (Dr. Siu-On Chan) was held.
- December 6, 2013 ELC Mini-Workshop on Sublinear-Time Algorithms (A02) was held.
- December 1, 2013 ELC Mini-Workshop (B01 + C03) (11/30 – 12/1) was held.
- November 30, 20133rd General Meeting (11/29 – 11/30) was held.
- November 16, 201315th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013) (11/13 – 11/16) was held.
- November 12, 2013Science Cafe “What is the Limits of Computation” (11/12) was held.