Pastāsti draugiem par šo preci:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
Do you have a profile? Pierakstīties
Saņemiet paziņojumus par jauniem Satya Lokam izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2009. gada 20. jūlijs |
| ISBN13 | 9781601982421 |
| Izdevēji | now publishers Inc |
| Lapas | 176 |
| Izmēri | 156 × 234 × 10 mm · 254 g |
| Valoda | Angļu |
