Skip to main content
PBS logo
 
 

Search - Subrecursive Programming Systems: Complexity and Succinctness (Progress in Theoretical Computer Science)

Subrecursive Programming Systems: Complexity and Succinctness (Progress in Theoretical Computer Science)
Subrecursive Programming Systems Complexity and Succinctness - Progress in Theoretical Computer Science
Author: James S. Royer, John Case
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 il...  more »
ISBN-13: 9783764337674
ISBN-10: 3764337672
Pages: 264
Rating:
  ?
0 stars, based on 0 rating
Publisher: Birkhauser Verlag AG
Book Type: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review



Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.