Computer Science 6789, Fall '26
Course Diary
Copyright 2026 by Todd Wareham
All rights reserved
Week 1,
Week 2,
(end of diary)
In the notes below, the acronyms 6789W14 and vR+19 will refer to the
course diary for COMP 6789 (Winter 2014) and van Rooij et al (2019),
respectively.
Tuesday, September 15 (Lecture #1)
- Review: Classical Computational Complexity Analysis
(6789W14, Lectures #1-3; vR+19, Chapers 2-3)
Tuesday, September 22 (Lecture #2)
- Review: Classical Computational Complexity Analysis (Cont'd)
(6789W14, Lectures #3-5; vR+19, Chapers 3-4)
References
- Downey, R.G. and Fellows, M.R. (1999) Parameterized Complexity.
Springer; Berlin.
- Flum, J. and Grohe, M. (2006) Parameterized Complexity Theory.
Springer; Berlin.
- Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability:
A Guide to the Theory of NP-Completeness. W.H. Freeman;
San Francisco.
- Niedermeier, R. (2006) Invitation to Fixed-Parameter Algorithms.
Oxford University Press.
-
van Rooij, I., Blokpoel, M., Kwisthout, J., and Wareham, T. (2019)
Cognition and Intractability: A Guide to Classical and Parameterized
Complexity Analysis. Cambridge University Press.
-
Wareham, T. (1999) Systematic Parameterized Complexity Analysis in
Computational Phonology. Ph.D. thesis, Department of Computer Science,
University of Victoria. (PDF)
Created: August 6, 2026
Last Modified: August 6, 2026