Subrecursive Programming Systems: Complexity and Succinctness (Progress in Theoretical Computer Science) - Hardcover
Synopsis
This text develops the theory of subrecursive programming systems and applies it to the more general theory of structural complexity theory. Its first goal is to establish relative program succinctness between systems, improving and subsuming most prior results in this area and introducing several forms of the phenomena. Its second goal is to illustrate the applicability of these tools in the context of structural complexity theory. This book is suitable for researchers aquainted with the theory of computation and comfortable with mathematical proofs. It can also be used by computer science and mathematics advanced undergraduates and graduates.
"synopsis" may belong to another edition of this title.
- PublisherBirkhauser Verlag AG
- Publication date1994
- ISBN 10 3764337672
- ISBN 13 9783764337674
- BindingHardcover
- LanguageEnglish
- Number of pages264
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
