Boolean Function Complexity
Material type: Computer fileLanguage: English Publication details: Berlin, Heidelberg Springer Berlin Heidelberg 2012. ISBN: 9783642245084, 978-3-642-24508-4Subject(s): Information and Communication, Circuits | Combinatorics | Combinatorics | Computer science | Information theory | Mathematics | Mathematics | Mathematics of Computing | Theory of ComputationDDC classification: 519, Online resources: Click here to access onlineItem type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
E(electronic)-Books | NISER LIBRARY | 519, 23 (Browse shelf(Opens below)) | Available | E2191 |
Mathematics and Statistics (Springer-11649)
There are no comments on this title.