Fortell venner om denne varen:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
Har du en profil? Logg inn
Få varsel om nye utgivelser fra Satya Lokam
Legg til iMusic ønskeliste
eller
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
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 20. juli 2009 |
| ISBN13 | 9781601982421 |
| Utgivere | now publishers Inc |
| Antall sider | 176 |
| Mål | 156 × 234 × 10 mm · 254 g |
| Språk | Engelsk |
