Linear Programming: Bit Complexity || @ CMU || Lecture 17c of CS Theory Toolkit @RyanODonnellTeaching
Linear Programming: Bit Complexity || @ CMU || Lecture 17c of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 3 hours ago
It is shown that *if* a Linear Program is feasible, then it has a feasible solution that can be written down with a polynomial of bits. Combined with LP duality, this implies Linear Programming is in NP ∩ coNP. (We will later see it is in P.) Lecture 17c of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
"Understanding and Using Linear Programming" by Matoušek and Gärtner
"Geometric Algorithms and Combinatorial Optimization" by Grötschel, Lovász, and Schrijver

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Linear Programming: Bit Complexity || @ CMU || Lecture 17c of CS Theory Toolkit#55/100: Grovers Algorithm, Part 2 || Quantum Computer Programming in 100 Easy LessonsEntropy, and cryptographic pseudorandom generators || @ CMU || Recitation 12 of CS Theory ToolkitCSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit#32/100: Correlation of Boolean functions || Quantum Computer Programming in 100 Easy LessonsRandom Reversible Circuits || For Tim Gowerss 60th Birthday WorkshopSpectral Graph Theory: eigenvalues || @ CMU || Lecture 15a of CS Theory Toolkit#78/100: Classical win probability of CHSH is 75% | Quantum Computer Programming in 100 Easy LessonsEpsilon-biased Generators || @ CMU || Lecture 12d of CS Theory ToolkitLayer cakes and slivers || @ CMU || Recitation 3 of CS Theory Toolkit#60/100: 1-qubit Rotation Estimation: Overview || Quantum Computer Programming in 100 Easy Lessons#59/100: Grover when you know p to within 1% || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Linear Programming: Bit Complexity || @ CMU || Lecture 17c of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER