It is not the case that Edmonds demonstrated that a problem previously thought to require brute force search (a generalization of Perfect Matching) is in fact solvable in polynomial time, illustrating that polynomial time can capture genuinely tractable problems.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.