Povedzte o tejto položke priateľom:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
Do you have a profile? Prihlásiť sa
Vianočné darčeky je možné vrátiť do 31. januára
Dostávajte upozornenia na nové nahrávky interpreta Satya Lokam
Naši zákazníci hovoria:
Pridať do vášho zoznamu prianí na iMusic
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science
Satya Lokam
Surveys several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches. The common theme among these approaches is to study robustness measures of matrix rank that capture the complexity in a given model.
176 pages
| Médium | Knihy Paperback Book (Kniha s mäkkou väzbou a lepeným chrbtom) |
| Vydané | 20. júla 2009 |
| ISBN13 | 9781601982421 |
| Vydavatelia | now publishers Inc |
| Strany | 176 |
| Rozmery | 156 × 234 × 10 mm · 254 g |
| Jazyk | Angličtina |
