Boolean function complexity Advances and Frontiers by Stasys Jukna
Material type:![Book](/opac-tmpl/lib/famfamfam/BK.png)
- 9783642245077
- 511.324 P12 (CSA)
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
![]() |
Computer Science and Automation | 511.324 P12 (CSA) (Browse shelf(Opens below)) | Available | 193096 |
Browsing Computer Science and Automation shelves Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.3 P15 (CSA) Introduction to mathematical logic | 511.3 WIG/M Mathematics and computation a theory revolutionizing technology and science | 511.322 P09 (CSA) Paul R. Halmos Naive Set Theory | 511.324 P12 (CSA) Boolean function complexity Advances and Frontiers | 511.35 P08 (CSA) Introduction to automata theory languages and computation | 511.352 P08 (CSA) Computational complexity A Conceptual Perspective | 511.352 P08;1 (CSA) Computational complexity: A Conceptual perspective |
There are no comments on this title.