Main
Home
/
Tags
/
shortest-paths
shortest-paths
1 page tagged.
Computer science / Coursework / Randomized algorithms
Lecture 4.3: Design Methods III
The witness method — randomly hunt an element proving a property: primality (Fermat → Miller–Rabin → Solovay–Strassen), plus witnesses for Boolean matrix products rebuilding all-pairs shortest paths.