Boolean function complexity : advances and frontiers / Stasys Jukna.
By: Jukna, Stasys.
Material type: TextSeries: Algorithms and combinatorics ; v. 27.Publisher: Berlin ; London : Springer, c2012Description: xv, 615 p., E 94.95 ill. ; 24 cm.ISBN: 9783642245077 (hbk.) :; 3642245072 (hbk.) :.Subject(s): Computational complexity | Computer science -- Mathematics | Combinatorial analysisDDC classification: 511.352Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Book | Chennai Mathematical Institute General Stacks | 511.352 JUK (Browse shelf) | Available | 8821 |
Total holds: 0
Browsing Chennai Mathematical Institute Shelves , Shelving location: General Stacks Close shelf browser
511.352 ARO Computational complexity : a modern approach / | 511.352 COP Computability : Turing, Gödel, Church, and beyond / | 511.352 FOR The golden ticket : P, NP, and the search for the impossible / | 511.352 JUK Boolean function complexity : advances and frontiers / | 511.352 KOZ Theory of computation / | 511.352 KOZ Automata and computability / | 511.352 KOZ Automata and computability / |
Formerly CIP. Uk
Includes bibliographical references and index.
Current copyright fee: GBP25.77 22\3 Uk