Complexity of linear boolean operators
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
![](/opac-tmpl/bootstrap/itemtypeimg/npl/Rare-Book.gif)
Current library | Home library | Call number | Materials specified | Status | Date due | Barcode |
---|---|---|---|---|---|---|
IMSc Library | IMSc Library | 681.4 FTTCS (Browse shelf (Opens below)) | Available | 69845 |
Browsing IMSc Library shelves Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
681.4 FTTCS Lx = b | 681.4 FTTCS Bayesian mechanism design | 681.4 FTTCS Online matching and ad allocation | 681.4 FTTCS Complexity of linear boolean operators | 681.4 FTTCS Sketching as a tool for numerical linear algebra | 681.4 FTTCS Faster algorithms via approximation theory | 681.4 FTTCS Algorithmic foundations of differential privacy |
There are no comments on this title.