Subrecursive Programming Systems: Complexity and Succinctness - Progress in Theoretical Computer Science - James S. Royer - Grāmatas - Birkhauser Boston Inc - 9780817637675 - 1994. gada 1. augusts
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Subrecursive Programming Systems: Complexity and Succinctness - Progress in Theoretical Computer Science 1994 edition

Cena
€ 103,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 4. - 12. jūn.
Pievienot savam iMusic vēlmju sarakstam

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

Mediji Grāmatas     Hardcover Book   (Grāmata ar cieto muguriņu un vāku)
Izlaists 1994. gada 1. augusts
ISBN13 9780817637675
Izdevēji Birkhauser Boston Inc
Lapas 253
Izmēri 156 × 234 × 15 mm   ·   544 g
Valoda Angļu