Tell your friends about this item:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
Do you have a profile? Log in
Get notified about new Satya Lokam releases
Our customers say:
Add to your iMusic wish list
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 | Books Paperback Book (Book with soft cover and glued back) |
| Released | July 20, 2009 |
| ISBN13 | 9781601982421 |
| Publishers | now publishers Inc |
| Pages | 176 |
| Dimensions | 156 × 234 × 10 mm · 254 g |
| Language | English |
