この商品を友人に教える:
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 |
| 言語 | 英語 |
