@book{lokam2009complexity,
author = {Lokam, Satya},
title = {Complexity Lower Bounds using Linear Algebra},
series = {Foundations and Trends in Theoretical Computer Science},
booktitle = {Foundations and Trends in Theoretical Computer Science},
year = {2009},
month = {July},
abstract = {Complexity Lower Bounds using Linear Algebra 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.},
url = {http://approjects.co.za/?big=en-us/research/publication/complexity-lower-bounds-using-linear-algebra/},
pages = {1-155},
volume = {4},
}