Image from Amazon.com
Boolean function complexity : advances and frontiers
Material type:
TextSeries: Algorithms and combinatorics ; 27.Publication details: London : Springer, c2012.Description: xv, 617 p. : ill. ; 24 cmISBN: - 9783642245077
- 511.352 JUK-B
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Books
|
IIITD Reference | Mathematics | REF 511.352 JUK-B (Browse shelf(Opens below)) | Available | 004430 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| REF 511.352 COP-C Computability : | REF 511.352 FOR-G The golden ticket : | REF 511.352 GOL-C Computational complexity : | REF 511.352 JUK-B Boolean function complexity : | REF 511.352 SOA-T Turing computability | REF 511.352 TUR-T Theory of computation | REF 511.36 KAN-W Writing proofs in analysis |
Includes bibliographical references and index.
There are no comments on this title.