Matthew Anderson Research Associate

Current Research Interests:

Complexity Theory, Descriptive Complexity, Algebraic Complexity, Circuit Lower Bounds, Derandomization, Polynomial Identity Testing, Locality, Tensor Rank

Biography:

Matthew Anderson is currently doing post-doctorate research in Descriptive and Algebraic Complexity at the University of Cambridge Computer Laboratory under the supervision of Anuj Dawar.

Matthew completed his Ph.D. thesis Advancing Algebraic and Logical Approaches to Circuit Lower Bounds in Computer Sciences at the University of Wisconsin-Madison in May 2012 and was advised by Professor Dieter van Melkebeek. 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.