This project is part of Probabilistic Techniques & Randomized Algorithms elective course in Computer Engineering & Informatics Department of University of Patras for Winter Semester 2024-2025 (Semester 9).
This repository was archived by the owner on Mar 18, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project is a homework assignment on probabilistic techniques and randomized algorithms. It involves problems related to random graphs, Ramsey theory, graph colorings, k-SAT, Markov chains, and random walks. The tasks require proving statements, finding probability distributions, and analyzing convergence properties in probabilistic models.
miltiadiss/CEID_NE5017-Probabilistic-Techniques-and-Randomized-Algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project is a homework assignment on probabilistic techniques and randomized algorithms. It involves problems related to random graphs, Ramsey theory, graph colorings, k-SAT, Markov chains, and random walks. The tasks require proving statements, finding probability distributions, and analyzing convergence properties in probabilistic models.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published