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 ...
Read More
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.
Read Less
Add this copy of An Algorithmic Theory of Numbers, Graphs and Convexity to cart. $11.38, Sold by Zubal Books rated 4.0 out of 5 stars, ships from Cleveland, OH, UNITED STATES, published 1987 by Society for Industrial and Applied Mathematics.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Publisher:
Society for Industrial and Applied Mathematics (SIAM)
Published:
1987
Language:
English
Alibris ID:
18242656655
Shipping Options:
Standard Shipping: $4.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
91 pp., paperback, ex library, else text clean and binding tight. -If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Add this copy of An Algorithmic Theory of Numbers, Graphs and Convexity to cart. $12.06, good condition, Sold by Midtown Scholar Bookstore rated 5.0 out of 5 stars, ships from Harrisburg, PA, UNITED STATES, published 1987 by Society for Industrial and Appli.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Add this copy of An Algorithmic Theory of Numbers, Graphs and Convexity to cart. $54.82, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1987 by Society for Industrial and App.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Add this copy of An Algorithmic Theory of Numbers, Graphs and Convexity to cart. $107.13, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 1987 by Society for Industrial and App.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Add this copy of An Algorithmic Theory of Numbers, Graphs and Convexity to cart. $111.99, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1987 by Society for Industrial and App.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
