A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization.
An Algorithmic Theory of Numbers, Graphs and Convexity Free Download
July 26, 2022
You may also like
Elementary Algebra is a highly respected, one-year high school curriculum offering practical, real-life applications in an easy to follow format. Students will...
ALGEBRA MATHEMATICS
Early Algebra Research into its Nature, its Learning, its Teaching by Carolyn Kieran PDF
June 23, 2024
This survey of the state of the art on research in early algebra traces the evolution of a relatively new field of research and teaching practice. With its...
“Your world is profoundly mathematical.” Bob Blitzer continues to support and inspire students with his friendly approach, making Algebra and...
Recent Posts
- Nuclear Physics Exploring the Heart of Matter PDF
- Applied Physics Crash Course by Arthur Beiser PDF
- Variational Principles in Physics by Jean-Louis Basdevant PDF
- Analytical Chemistry by Dhruba Charan Dash PDF
- Handbook of Modern Sensors Physics, Designs, and Applications 3rd Edition by Jacob Fraden PDF
Add Comment