Tell your friends about this item:
Subrecursive Programming Systems: Complexity and Succinctness - Progress in Theoretical Computer Science James S. Royer 1994 edition
Subrecursive Programming Systems: Complexity and Succinctness - Progress in Theoretical Computer Science
James S. Royer
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; its second is to illustrate the applicability of these tools.
253 pages, biography
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | August 1, 1994 |
| ISBN13 | 9780817637675 |
| Publishers | Birkhauser Boston Inc |
| Pages | 253 |
| Dimensions | 156 × 234 × 15 mm · 544 g |
| Language | English |
More by James S. Royer
Show allSee all of James S. Royer ( e.g. Paperback Book and Hardcover Book )
Christmas presents can be returned until 31 January