results problems combinatorial geometry von boltjansky vladimir (17 Ergebnisse)

Paperback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Hardcover. Zustand: Good. No Jacket. 1st Edition. Octavo bound in paper-covered boards. Condition: ex-library copy with some obliterated library marks; minor wear; else good. 108 pages.

Zustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Re-bound by library. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,350grams, ISBN:0521262984.

Zustand: Good+. Zustand des Schutzumschlags: No Dust Jacket. First Edition. Original blue printed wrappers. With diagrams. Slight fading to covers and spine. Slight wear to spine, covers and corners. ; 13.2x21x0.6 cm; 108 pages Softcover (Original printed wrappers).

Zustand: New.

Zustand: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.

Paperback. Zustand: new. Paperback. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Zustand: New. In.

Paperback. Zustand: New.

Zustand: New. pp. 120.

Paperback. Zustand: new. Paperback. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Zustand: new. Paperback. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,350grams, ISBN:0521262984.

Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 190.

Zustand: New. Print on Demand pp. 120 1:B&W 5.5 x 8.5 in or 216 x 140 mm (Demy 8vo) Perfect Bound on Creme w/Gloss Lam.

Zustand: New. PRINT ON DEMAND pp. 120.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk s partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to e.