Combinatorial Computing
CP
Mentors :
Soham Joshi
Ameya Vikrama Singh
Adarsh Reddy
Mentees :
4-6
The project will introduce some interesting mathematical, computational structures and structure generation tricks, often used in competitive coding. Moreover, this will be interlaced with combinatorial ideas, and clever ways to solve combinatorial problems including boolean algebra, SAT solvers, graph algorithms, number theoretic results and much more. We will also cover recent advances in combinatorics brought about by computers. The project will impart a sound theoretic understanding of these problems and will also involve hands-on implementation for solutions to some of these problems.
Prerequisites:
Basics of C++ Programming, Enthusiasm towards puzzles :)
Tentative Timeline :
| Week | Work |
|---|---|
| Week 1 | Computer Representation of Mathematical Objects |
| Week 2 | Backtrack Programming, enumeration by exhaustive search |
| Week 3 | Satisfiability and SAT Solvers |
| Week 4 | Generation of Elementary Configurations, permutations, partitions and sets |
| Week 5 | Miscellaneous algorithmic techniques, Graph algorithms |
| Week 6 | Elementary Number Theoretic Algorithms |
| Week 7 | Latin squares, four color problem, and other advanced combinatorial problems |
| Week 8 | Parker Square Generation, Final Presentation |
