CO 457BBoolean Methods In Discrete Optimization
- Faculty
- Mathematics
- Last listed
- 1978–79
No longer offered. It’s in Waterloo’s scanned calendars from 1978–79 to 1978–79 (before that, 1976–77 to 1977–78 used the number for Information Retrieval 2); the 1995–96 to 2023–24 calendars are on ucalendar.
Elements of Boolean algebra, Boolean functions and expressions. Implicants, prime implicants. Solving linear programmes in 0-1 variables. Minimization of quadratic functions. Monotonicities, assumability, thresholdness. Applications to graphs, games. Theoretical and algorithmic developments. Research problems. Prereq: C&0457a
As printed in the 1978–79 calendar, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1976–77 to 1978–79, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1978–79 1 calendar
Elements of Boolean algebra, Boolean functions and expressions. Implicants, prime implicants. Solving linear programmes in 0-1 variables. Minimization of quadratic functions. Monotonicities, assumability, thresholdness. Applications to graphs, games. Theoretical and algorithmic developments. Research problems. Prereq: C&0457a
1976–77 to 1977–78 2 calendars
Another title: Information Retrieval 2, probably a different course under the same number (or a misread scan).
This course considers the application of combinatorial structures, such as block designs, to information retrieval. The construction of such structures will be considered together with methods for optimising a general model for the retrieval problem.
* Listed that year without a description, or as not offered.