Verwandte Artikel zu Nl Hierarchy (Classic Reprint)
Inhaltsangabe
Excerpt from Nl Hierarchy
We note that the Ruzzo, Simon, and Tompa model of space-bounded oracle machine is a special case of our model. We now show an application of our model. We will use this idea later to build up an oracle hierarchy.
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,57
EUR 0,81 für den Versand von USA nach Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Nl Hierarchy (Classic Reprint)
Beispielbild für diese ISBN
Nl Hierarchy Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333579692
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Nl Hierarchy Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333579692
Anzahl: 15 verfügbar
Foto des Verkäufers
Nl Hierarchy (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. Print on Demand. This book introduces a new complexity class INL, composed of languages accepted by a nondeterministic Turing machine with a one-way read-only input head and logarithmic space. The author demonstrates that INL is not closed under complementation, and investigates the power of inductive counting, the main proof technique used by Immerman to show that nondeterministic space is closed under complementation. This leads to the introduction of a new oracle model and a strict hierarchy of languages. The author concludes by showing that if INL can simulate deterministic space-bounded oracle machines, then nondeterministic space is equal to deterministic space for constructible space-bounded functions. This book delves into the complexity of inductive counting, oracle models, and space-bounded computations, offering valuable insights for researchers and students in theoretical 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. Bestandsnummer des Verkäufers 9781333579692_0
Anzahl: Mehr als 20 verfügbar