We are a research group in theoretical computer science, in particular complexity theory. Our goal is to understand which problems are easy and which problems are hard to compute. We mainly work in algebraic models, proving lower bounds for algebraic circuits as well as designing efficient algebraic algorithms.
yielding clever and involved constructions to resulted in asymptotically faster and faster algorithms. The current world record is O(n2.373). While we know some (unfortunately very modest) lower bounds for the number of operations, we do not know any nontrivial lower bound on the exponent. One aim of our research is to understand the exponent of matrix multiplication better. Read more about the theory of fast matrix multiplication algorithms here >>>.