Mod-01 Lec-39 Simplex Algorithm is not polynomial time- An example.
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceProves the Simplex algorithm is not polynomial time with a concrete example. Complexity theory result with algorithmic construction.
A 59-minute video from nptelhrd: “Mod-01 Lec-39 Simplex Algorithm is not polynomial time- An example.”.
Video by nptelhrd, played through YouTube's embedded player.