Cart
Boolean function complexity : advances and frontiers
By: Jukna, Stasys.
Material type:
BookSeries: Algorithms and combinatorics: 27.Publisher: London : Springer, c2012Description: xv, 617 p. : ill. ; 24 cm.ISBN: 9783642245077.Subject(s): Computational complexity | Computer science -- Mathematics | Combinatorial analysisOnline resources: Inhaltsverzeichnis | Inhaltstext
| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Books
|
IIITD Reference | Mathematics | REF 511.352 JUK-B (Browse shelf) | Available | 004430 |
Total holds: 0
Browsing IIITD Shelves , Shelving location: Reference , Collection code: Mathematics Close 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 for this item.