Excerpt from Robotics Research Technical Report, Vol. 204: Improved Lower Bounds on the Length of Davenport-Schinzel Sequences
Work on this paper has been supported by Office of Naval Research Grant n00014-82-k-0381, National Science Foundation Grant No. Nsf-dcr-83-20085, and by grants from the Digital Equipment Corporation, and the ibm Corporation.u1¢543+1f0f 311i.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 9,90 per la spedizione da Germania a Italia
Destinazione, tempi e costiEUR 1,91 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332142828
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332142828
Quantità: 15 disponibili
Da: Buchpark, Trebbin, Germania
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Codice articolo 26057670/2
Quantità: 1 disponibili
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. Print on Demand. This book makes a stride forward in the study of Davenport-Schinzel (DS) sequences. DS sequences are a combinatorial object with multiple applications in computational geometry. This book expands on existing knowledge of these sequences, specifically concerning the minimal length they can be. The author shows that, for odd length sequences, the minimal length grows extremely slowly. This growth rate is formally defined by the author, but in essence it grows slower than any computable function. The book uses a technique the author previously developed for a specific case of DS sequences and expands it to cover all cases. This work refines our understanding of a specific combinatorial object and pushes our knowledge of their properties and behavior further. 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. Codice articolo 9781332142828_0
Quantità: Più di 20 disponibili