Boolean Function Complexity: advances and frontiers
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current library | Call number | Materials specified | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
![]() |
Central Library | 004.01511352 JUK(BOO) (Browse shelf(Opens below)) | 1 | Available | 18206 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
No cover image available | No cover image available |
![]() |
||
004.01511352 HOM(COM) Computability and Complexity Theory | 004.01511352 JON(COM) Computability and complexity: from a programming perspective | 004.01511352 JON(COM) Computability and complexity: from a programming perspective | 004.01511352 JUK(BOO) Boolean Function Complexity: advances and frontiers | 004.01511352 KUS(COM) Communication complexity | 004.01511352 KUS(COM) Communication complexity | 004.01511352 MAR(CON) Concise guide to Computation Theory |
bill No. SAR/207/2011; dt.20.02.2012
There are no comments on this title.