Image from Amazon.com
Computational complexity of counting and sampling
Material type:
TextLanguage: English Series: Discrete mathematics and its applicationsPublication details: CRC Press 2019Description: xvii, 390pISBN: - 9781138035577 (PB)
- 511.352 MIK(COM)
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
Books
|
Central Library | 511.352 MIK(COM) (Browse shelf(Opens below)) | 1 | Available | 30519 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 511.352 BRI(COM) Computability : a mathematical sketchbook | 511.352 COO(COM) Computability, enumerability, unsolvability : direction in recursion theory | 511.352 KLE(CAU) Causality, probability, and time | 511.352 MIK(COM) Computational complexity of counting and sampling | 511.352 NIE(COM) Computability and randomness | 511.352 RAO(COM) Communication complexity and applications | 511.352 WEB(COM) Computability theory |
There are no comments on this title.
Log in to your account to post a comment.