MPRI 1.24 - Algorithmes Randomisés (Nicolas Schabanel, CNRS - Université Paris Diderot)
[ Cours n°4 Partie A/C ]
Cours n°4: Mardi 20 Nov. 2012 - 16:30-19:30
1) Fingerprint: identity testing
2) Polynomial identity testing
3) Pattern matching
Séance d'exercices n°4
1) Traffic monitoring
2) A constant-time approximation scheme (CTAS) for maximal matching size in constant degree graphs
[ Cours n°4 Partie A/C ]
Cours n°4: Mardi 20 Nov. 2012 - 16:30-19:30
1) Fingerprint: identity testing
2) Polynomial identity testing
3) Pattern matching
Séance d'exercices n°4
1) Traffic monitoring
2) A constant-time approximation scheme (CTAS) for maximal matching size in constant degree graphs
Category
🤖
Technologie