Vertel uw vrienden over dit artikel:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
Heb je een profiel? Inloggen
Ontvang meldingen over nieuwe releases van Satya Lokam
Onze klanten zeggen:
Voeg toe aan uw iMusic-verlanglijst
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 | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 20 juli 2009 |
| ISBN13 | 9781601982421 |
| Uitgevers | now publishers Inc |
| Pagina's | 176 |
| Afmetingen | 156 × 234 × 10 mm · 254 g |
| Taal en grammatica | Engels |
