Povej prijatelju o tem izdelku:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
Do you have a profile? Prijava
Prejemajte obvestila o novih izdajah izvajalca Satya Lokam
Kaj pravijo naše stranke:
Dodaj na svoj seznam želja 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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 20. julija 2009 |
| ISBN13 | 9781601982421 |
| Založniki | now publishers Inc |
| Strani | 176 |
| Dimenzije | 156 × 234 × 10 mm · 254 g |
| Jezik | Angleščina |
