A card from a free library — ask anything, no account, works offline. Every card carries its source.
Edmonds 1965 — Paths, trees, and flowers
chain
J. Edmonds (1965). Paths, trees, and flowers. Canad. J. Math. 17 (1965) 449–467. DOI 10.4153/CJM-1965-045-4. Canonical: https://doi.org/10.4153/CJM-1965-045-4. Cited by its record. License as found: Cambridge University Press — publisher's copyright, cited. What it gave the chain: a 'good' algorithm is a polynomial-time one: the class P named by its intent.
source
card id
card_chain_edmonds_1965
address
WIT.codex.FCT/paths-trees-and-flowers/REF.WITNESSED@j-edmonds
adjoining cards
- builds on → Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem — a 'good' algorithm is a polynomial-time one: the class P named by its intent
Is this card incomplete? Tell the library — it will call out for more ↗