Image from Amazon.com
Boolean function complexity : advances and frontiers by Stasys Jukna
Material type:
BookSeries: ; | Algorithms and combinatorics ; v. 27.Current publication frequency: .Publication details: Berlin Springer-Verlag c2012Edition: Description: xv, 615 p.: ill; 24cmISBN: - 9783642245077
- 511.352 JUN
| Item type | Current library | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Books
|
IIT Gandhinagar | General | 511.352 JUN (Browse shelf(Opens below)) | Available | 011425 |
Browsing IIT Gandhinagar shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 621.3821 GER Models of network reliability: analysis, combinatorics, and Monte Carlo | 519.5 OGU Random phenomena : fundamentals of probability and statistics for engineers | 004.678 KUR Computer networking : a top-down approach featuring the Internet | 511.352 JUN Boolean function complexity : advances and frontiers | 511.3 BLU Complexity and real computation | 511.3 IMM Descriptive complexity | 511.34 EBB Finite model theory |
Includes bibliographical references and index.
There are no comments on this title.