The Computer Science Department plans to debut a new course—Computer Science 20: “Discrete Mathematics in Computer Science”— next spring that will better prepare students for the required ...
This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...
We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...
An introduction to discrete mathematics, including combinatorics and graph theory. The necessary background tools in set theory, logic, recursion, relations, and functions are also included. Masters ...
We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback