Exploring why some polyhedral containment problems defy easy answers.
This work examines how certain seemingly straightforward questions about placing one polyhedron inside another fall into the hard, NP-complete camp, shaping our understanding of computational limits in geometry and optimization.
The discussion centers on three set containment problems, each formed by X and Y as special polyhedral or ball-like shapes. It also looks at the related integer containment problem and the complexity of finding integer points inside polyhedra. Readers will see how classical reductions connect these geometric questions to well-known hard problems, and how polynomial-time solvability in some cases does not extend to all."synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9780365899884_0
Quantity: Over 20 available