Lower bounds in communication complexity
Material type:
TextSeries: Foundations and trends in theoretical computer science ; Vol. 003 : Iss.4Publication details: Boston ; Now Publishers ; 2007Description: 141ISBN: 9781601982582
BOOKS
| Current library | Home library | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | 681.4 FTTCS (Browse shelf (Opens below)) | Available | 63092 |
Browsing IMSc Library shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 681.4 FTTCS Algorithms and data structures for external memory | 681.4 FTTCS Probabilistic proof systems | 681.4 FTTCS Complexity lower bounds using linear algebra | 681.4 FTTCS Lower bounds in communication complexity | 681.4 FTTCS Spectral algorithms | 681.4 FTTCS Pseudorandomness | 681.4 FTTCS Evasiveness of graph properties and topological fixed point theorems |
There are no comments on this title.