This repository contains programming tasks and solutions from the "Discrete Mathematics" course, with a focus on Graph Theory and Recursive Relations. The primary aim is to solve advanced problems in ...

Discrete Mathematics II addresses abstract, discrete, computational methods used in computer science. In particular, this class introduces searching and sorting algorithms; big-O estimates; number ...

Mathematical thinking is crucial in all areas of computer science: algorithms, bioinformatics, computer graphics, data science, machine learning, etc. In this course, we will learn the most important ...

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 ...

Abstract: This paper presents a recursive least-squares approach to estimate simultaneously the state and the unknown input of linear time varying discrete time systems with unknown input. The method ...

Description: The course covers topics in discrete mathematics which are essential to the discipline of computer technology. These include: logic, sequences, mathematical induction, basic set theory, ...

This is an introductory course in Discrete Mathematics oriented towards Computer Science. It covers the principles of mathematics from the foundation of computing. By the end of this course, students ...

Abstract: The paper presents models for discrete-time point processes (DTPP) and schemes for recursive estimation of signals randomly influencing their rates. Although the models are similar to the ...

ABSTRACT: This paper develops a new method for calculating the system size distribution on two different M/G/1 queueing system under N-policy with general startup/closedown. Firstly, the stochastic ...