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.
Information Theory and Statistics: A Tutorial Information Theory and Statistics: A Tutorial is concerned with applications of information theory concepts in statistics, in the finite alphabet setting. The topics covered include large deviations, hypothesis testing, maximum likelihood estimation in exponential families, analysis of contingency tables, and iterative algorithms with an... Calculus I with Precalculus (Textbooks Available with Cengage Youbook)
CALCULUS I WITH PRECALCULUS, brings you up to speed algebraically within precalculus and transition into calculus. The Larson Calculus program has been widely praised by a generation of students and professors for its solid and effective pedagogy that addresses the needs of a broad range of teaching and learning styles and environments. Each...
Level Up Your Web Apps With Go: Performance, Concurrency, Scalability
Go is an open-source language from Google that's a bit like C. Designed for programmer productivity, it's got a clean syntax, and emphasizes concurrency.
This book gives you all you need to use Go in your web applications. You'll learn the basic concepts - language structures, the standard library, and Go...
Analytics: The Agile Way (Wiley and SAS Business Series)
For decades now, companies big and small have embraced Agile software development methods. The rationale here is straightforward:
Why take one or two years to fully deploy a system, app, or website when so many things can and do go wrong?
Why try to cook one big batch and boil the ocean?