A search problem refers to the task of finding a solution within some space of possible options, and that space could be made up of discrete steps or continuously varying values. For example, solving ...

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