Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
