Artículos relacionados a Nl Hierarchy (Classic Reprint)
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 18,43
EUR 0,61 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Nl Hierarchy (Classic Reprint)
Imagen de archivo
Nl Hierarchy Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333579692
Cantidad disponible: 15 disponibles
Imagen de archivo
Nl Hierarchy Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333579692
Cantidad disponible: 15 disponibles
Imagen del vendedor
Nl Hierarchy (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: 9781333579692_0
Cantidad disponible: Más de 20 disponibles