Some functionalities in Discrete Mathematics include algorithms, set theory, graphs, statements in logic, recursion and probability, and so on.

This paper considers factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several ...

Brief Description of Course Content The course covers fundamental ideas from discrete mathematics, especially for computer science students. It focuses on topics that will be foundational for future ...