Park Jin-young, an assistant professor of mathematics at New York University, has emerged as a leading expert in probabilistic combinatorics, a branch of discrete mathematics, for her work in solving ...

A new approach has chipped away at a famously unsolved math problem: the ... Budapest-born mathematician Paul Erdos lived for most of the 20th century and made his name in discrete mathematics, ...

The goal of Computer Science is problem-solving with speedy solutions and Discrete Mathematics helps us solve real-world problems and daily projects and is comparatively easy to understand.

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...

Id: 008402 Credits Min: 3 Credits Max: 3 Description. An introduction to discrete mathematics, including combinatorics and graph theory. The necessary background tools in set theory, logic, recursion, ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...