If you don't hand it in you'll score a 1 for I will usually devote the last 10 minutes of each week to discussing the previous homework.Įach homework set will get a grade between 1 and 10 Or fax to 020-5924312 (from abroad: +31 20 5924312).Ĭooperation is allowed, but everyone has to hand in their own solution set in their own words You can hand it in on paper, or email me a readable file (rdewolf at cwidotnl no. There will be homework exercises every week, to be handed in at or before the start of the next lecture.
The course will be self-contained, though some prior familiarity with discrete mathematics, probability theory, linear algebra, and computational complexity theory will be helpful. Among the applications, we will describe a number of interesting and efficient algorithms, and analyze the limitations of computational systems like resolution-based theorem proving and Boolean circuits.
#DISCRETE MATHEMATICS WITH GRAPH THEORY 3RD EDITION SECTION 8.3 FULL#
It is the main branch of mathematics that one uses in theoretical computer science and related fields, and is full of beautiful techniques and results. Combinatorics is the art of counting and analyzing discrete structures with various properties, such as graphs, systems of sets, matrices, algorithms, etc. This course provides an applied introduction to combinatorics. University of Leiden course "Combinatorics with computer science applications" Combinatorics with computer science applications University of Leiden course, Spring 2008 semester