University of George Washington
9 février 2007 de 16 h 00 à 18 h 00 (heure de Montréal/HNE) Sur place
Colloque par Jack Edmonds (University of George Washington)
I hope my talk will be mostly an introductory survey about the complexity of search algorithms, about second Hamiltonian paths (traveling salesman routes) in graphs, and about bimatrix games (2-person Nash equilibria), with a bit about the connection between them. Biography: Jack Edmonds is widely regarded as one of the most important and influential contributors to the fields of computational complexity and combinatorial optimization. He was the recipient of the 1985 John von Neumann Theory Prize, and his seminal papers on matroids and matchings are regarded as amongst the most important papers in all of discrete mathematics.
AdresseUQAM, Pav. Sherbrooke, 200, rue Sherbrooke O., salle SH-3420