An Algorithmic Theory of Numbers, Graphs and Convexity: 50 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 50) - Tapa blanda

Lovasz, Laszlo

 
9780898712032: An Algorithmic Theory of Numbers, Graphs and Convexity: 50 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 50)
Tapa blanda
ISBN 10: 0898712033 ISBN 13: 9780898712032
Editorial: Society for Industrial and Applied Mathematics, 1987

Sinopsis

Studies two algorithms in detail: the ellipsoid method and the simultaneous diophantine approximation method.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Product Description

Book by Lovasz Laszlo

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Society for Industrial and Applied Mathematics
Año de publicación
1987
Idioma
Inglés
ISBN 10 
0898712033
ISBN 13 
9780898712032
Encuadernación
Tapa blanda
Número de páginas
97
Contacto del fabricante
no disponible
Persona responsable
no disponible