b. 1934
Jack Edmonds is a Canadian mathematician and computer scientist known for foundational contributions to combinatorial optimization and complexity theory. He formulated the influential thesis that polynomial-time computability should be the standard for 'efficient' algorithms, work that underpins modern discussions of the P vs NP problem and bears on philosophical debates about the nature of mathematical and logical knowledge.
Formulated the polynomial-time thesis distinguishing tractable from intractable problems
Developed the Blossom algorithm for maximum matching in general graphs
Made foundational contributions to matroid theory and polyhedral combinatorics
Pioneered the concept of 'good characterizations' anticipating the class NP ∩ co-NP
Advanced the mathematical framework informing the P vs NP question