Compution with recurrence relations
Material type: TextLanguage: English Series: Applicable mathematics seriesPublication details: Boston Pitman Advanced 1984Description: xii,310pISBN:- 0-273-08508-5
- 511.35 W757
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 511.35 W757 (Browse shelf(Opens below)) | Available | 107780 |
Total holds: 0
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | |||||||
511.35 Sh559 Degrees of unsolvability | 511.35 St933(31) Recursive analysis | 511.35 St933(6) Recursive number theory : a development of recursive arithmetic in a logic-free equation calculus | 511.35 W757 Compution with recurrence relations | 511.352 Ar769 Computational complexity a modern approach | 511.352 J93 Boolean function complexity : | 511.352 K64 Causality, probability, and time / |
There are no comments on this title.
Log in to your account to post a comment.