9781333655167 - on the complexity of motion planning for multiple independent objects: pspace hardness of the warehouseman's problem (classic reprint) di hopcroft, j. e. (3 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,35
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,23
EUR 3,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Altre immagini
- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 15,29
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book takes on the challenge of proving that the simple motion planning problem of moving a set of rectangular-shaped objects around in two dimensions is PSPACE-hard. PSPACE is a complexity class and this demonstration places this problem within this complexity class. The author e…stablishes a foundational connection between rewritable systems, symbol manipulation, and the seemingly unrelated problem of moving objects around in two dimensions. By establishing these relationships, this book contributes a new perspective on motion planning that provides a framework for solving more complicated motion planning problems in computer science. 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.
