ISBN: 9780898712032 - an algorithmic theory of numbers, graphs and convexity: 50 (cbms-nsf regional conference series in applied mathematics, series number 50) (13 resultados)

Condición: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condición: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condición: Very Good. *Price HAS BEEN REDUCED by 10% until Monday, Nov. 2 (weekend sale item)* 91 pp., paperback, very good. - 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.…

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: New. 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.…

Paperback. Condición: Brand New. 97 pages. 10.00x7.00x0.25 inches. In Stock.

Paperback. Condición: New. New copy - Usually dispatched within 4 working days.

Condición: New. 1987. paperback. . . . . . Books ship from the US and Ireland.

Condición: New. KlappentextrnrnA 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 wil.

Condición: New. 1987. paperback. . . . . .

Condición: New. Satisfaction Guaranteed or your money back.

Taschenbuch. Condición: Neu. Neuware - 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.…

Paperback. Condición: New. 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.…