where do combinatorics play a role in computer science?

8.5k Views Asked by At

I am graduated from computer science. I need some advice in Combinatorics material related to master fields of computer science. I already know that discrete mathematics have a key role in some concepts which I need a little more elaboration. In which fields could I trace combinatorics concepts and theorems and techniques?

1

There are 1 best solutions below

0
On

Graph Theory is a part of Combinatorics that is extremely important in computer science. Roughly, it is the study of objects and connections between them.

Algorithms and Data Structures uses combinatorial techniques for analysis and design extensively. Several Data Structures use graph theoretic ideas to efficiently store and retrieve data. Randomized Algorithms and Approximation Algorithms require combinatorial methods for analysis. They are often faster or more "useful" than deterministic ones.

Complexity Theory, the study of the complexity of resources used by computational procedures, use combinatorial problems and ideas as examples of several sorts of complexity classes. Discrete Optimization, in particular, is a class of problems which are of relevance to both theoreticians and practical purpooses. Some of them represent problems which are too hard for detereministic procedures and give way to randomized and approximate algorithms.

Other interesting Computer Science fields where combinatorics is important include Coding Theory(Error Correcting Codes over Communication Channels), Computational Geometry, etc.


Also see: Why is it important to study combinatorics?