|
Research Interests:Theory of Computing, Complexity Theory, Circuit Lower Bounds, Algebraic Complexity, Derandomization, Polynomial Identity Testing, Locality, Tensor RankBiography:Matthew Anderson is a Ph.D. candidate supervised by Professor Dieter van Melkebeek and expects to graduate in May 2012. Matthew completed his Master's Degree in Computer Science at the University of Wisconsin-Madison. Prior to coming to Madison, he received Bachelor's Degrees in Computer Science and Physics from Carnegie Mellon University in Pittsburgh, PA. |
