Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic - William Levine - Knjige - Birkhauser Boston Inc - 9780817639662 - 23. decembra 1998
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic 1999 edition

Cena
€ 110,99

Naročeno iz oddaljenega skladišča

Predvidena dobava 28. sep - 12. okt
Prejemajte obvestila o novih izdajah izvajalca William Levine
Dodaj na svoj seznam želja iMusic

Not rated yet

Na voljo tudi kot:

The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.


353 pages, biography

Medij Knjige     Hardcover Book   (Knjiga s trdim hrbtom in platnicami)
Izdano 23. decembra 1998
ISBN13 9780817639662
Založniki Birkhauser Boston Inc
Strani 353
Dimenzije 155 × 235 × 22 mm   ·   703 g
Jezik Angleščina  

Več od istega **izdajatelja**