Topics in Algebraic Complexity Theory

Interesting questions arise when one views algebraic operations on integers, matrices, or ideals, from an algorithmic perspective. Students with a background in both algebra and computer science may find these questions quite appealing. Possible topics for an honours or masters project include complexity classes and completeness results in algebra, tensor rank and matrix multiplication, and grobner basis methods in commutative algebra.

To find out more about these  and other problems, please contact Dr. David Smyth.