Customize your search:

E.g., 2017-09-22
E.g., 2017-09-22
E.g., 2017-09-22
Sep 25th 2017

Discrete mathematics forms the mathematical foundation of computer and information science. It is also a fascinating subject in itself. Learners will become familiar with a broad range of mathematical objects like sets, functions, relations, graphs, that are omnipresent in computer science. Perhaps more importantly, they will reach a certain level of mathematical maturity - being able to understand formal statements and their proofs; coming up with rigorous proofs themselves; and coming up with interesting results.

Average: 5.3 (3 votes)
Sep 18th 2017

Counting is one of the basic mathematically related tasks we encounter on a day to day basis. The main question here is the following. If we need to count something, can we do anything better than just counting all objects one by one? Do we need to create a list of all phone numbers to ensure that there are enough phone numbers for everyone? Is there a way to tell that our algorithm will run in a reasonable time before implementing and actually running it? All these questions are addressed by a mathematical field called Combinatorics.

Average: 9 (1 vote)
Aug 21st 2017

Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for deriving accurate asymptotics from the GF equations.

Average: 4.3 (12 votes)

Oct 27th 2014

Курс посвящен базовым понятиям комбинаторики. Кроме основных принципов, в курс также включены современные проблемы комбинаторного анализа.

No votes yet