Book contents
- Frontmatter
- Contents
- Preface
- 1 Combinatorial Discrepancy
- 2 Upper Bound Techniques
- 3 Lower Bound Techniques
- 4 Sampling
- 5 Geometric Searching
- 6 Complexity Lower Bounds
- 7 Convex Hulls and Voronoi Diagrams
- 8 Linear Programming and Extensions
- 9 Pseudorandomness
- 10 Communication Complexity
- 11 Minimum Spanning Trees
- A Probability Theory
- B Harmonic Analysis
- C Convex Geometry
- Bibliography
- Index
8 - Linear Programming and Extensions
Published online by Cambridge University Press: 05 October 2013
- Frontmatter
- Contents
- Preface
- 1 Combinatorial Discrepancy
- 2 Upper Bound Techniques
- 3 Lower Bound Techniques
- 4 Sampling
- 5 Geometric Searching
- 6 Complexity Lower Bounds
- 7 Convex Hulls and Voronoi Diagrams
- 8 Linear Programming and Extensions
- 9 Pseudorandomness
- 10 Communication Complexity
- 11 Minimum Spanning Trees
- A Probability Theory
- B Harmonic Analysis
- C Convex Geometry
- Bibliography
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511626371/resource/name/firstPage-9780511626371c8_p307-315_CBO.jpg)
- Type
- Chapter
- Information
- The Discrepancy MethodRandomness and Complexity, pp. 307 - 315Publisher: Cambridge University PressPrint publication year: 2000