2024/2025

Дискретная математика для разработки алгоритмов и программ

Статус: Маго-лего

Кто читает: Департамент анализа данных и искусственного интеллекта

Когда читается: 1 модуль

Охват аудитории: для всех кампусов НИУ ВШЭ

Преподаватели: Кузнецов Степан Львович

Язык: английский

Кредиты: 3

Course Syllabus

Abstract

This course includes the basics of computational complexity, Boolean logic and graph theory. The emphasis is put upon the algorithmic side: mathematical results act as a support for effecient algorithms operating in Boolean logic and graph theory. The course is actually twofold: besides usual «chalk-and-blackboard» mathematical part, it also includes a practical one, i.e., implementing the algorithms discussed in the course. The students are supposed and encouraged to (but not restricted to) use the Python language, including PLY (Python Lex&YACC) for parsing Boolean formulae.