分享给好友:
Complexity Lower Bounds using Linear Algebra - Foundations and Trends (R) in Theoretical Computer Science Satya Lokam
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
| 介质类型 | 图书 Paperback Book (平装胶订图书) |
| 已发行 | 2009年7月20日 |
| ISBN13 | 9781601982421 |
| 出版商 | now publishers Inc |
| 页数 | 176 |
| 商品尺寸 | 156 × 234 × 10 mm · 254 g |
| 语言 | 英语 |
