Items related to Nl Hierarchy (Classic Reprint)
Synopsis
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.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.12
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speeds
Search results for Nl Hierarchy (Classic Reprint)
Seller Image
Nl Hierarchy (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781333579692_0
Quantity: Over 20 available
Stock Image
Nl Hierarchy Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333579692
Quantity: 15 available
Stock Image
Nl Hierarchy Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333579692
Quantity: 15 available