Welcome to the Theory of Computation Group at the Department of Computer Science, Memorial University!
We study the limitations and capabilities of efficient computation. This includes areas such as computational complexity, algorithm design and analysis, logic, and combinatorics.
If you're interested in joining our mailing list to stay up to date on upcoming talks and events, please email Noah Fleming.
We study the limitations and capabilities of efficient computation. This includes areas such as computational complexity, algorithm design and analysis, logic, and combinatorics.
If you're interested in joining our mailing list to stay up to date on upcoming talks and events, please email Noah Fleming.
News
- We are accepting applications for graduate students. See Positions for further details.
Events
- Seminar: Morgan Shirley: An Improved Protocol for ExactlyN With More Than 3 Players Aug 23, 1-3, EN2022.
- Seminar: Jiawei Li: Total NP Search Problems with Abundant Solutions. July 18, 2-3, EN2022.
- Theory Reading Group.
Weekly, Thursdays 2-3, EN2022. - Seminar: Ian Mertz: The Tree Evaluation Problem: Context and Recent Results. Feb 7, 2-3, EN2022.
- Seminar: Vijay Ganesh: On The Unreasonable Effectiveness of SAT Solvers: Machine Learning + Logic Solvers. Nov 23, 2-3, EN2022.