
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and  in particular  combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms:  the ellipsoid method for finding a point in a convex set and  the basis reduction method for point lattices. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems. A combination of these techniques makes it possible to show the polynomial time solvability of many questions concerning poyhedra  for instance, of linear programming problems having possibly exponentially many inequalities. Utilizing results from polyhedral combinatorics, it provides short proofs of the poynomial time solvability of many combinatiorial optimization problems. For a number of these problems, the geometric algorithms discussed in this book are the only techniques known to derive polynomial time solvability. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson Prize, awarded by the Mathematical Programming Society and the American Mathematical Society. 


  Precalculus, 9th Edition
Larson's marketleading text, PRECALCULUS is known for delivering sound, consistently structured explanations and exercises of mathematical concepts to expertly prepare students for the study of calculus. With the ninth edition, the author continues to revolutionize the way students learn material by incorporating more realworld...   The C++ Programming Language (hardcover) (4th Edition)
The new C++11 standard allows programmers to express ideas more clearly, simply, and directly, and to write faster, more efficient code. Bjarne Stroustrup, the designer and original implementer of C++, has reorganized, extended, and completely rewritten his definitive reference and tutorial for programmers who want to use... 
