Theoretical computer science seeks to understand which computational problems can be solved by using a computer (computability theory) and how efficiently (computational complexity theory).
His research interests include algebraic geometry, symbolic computation and computational complexity theory in computer algebra, with over 130 published articles.
A separate branch of computability theory, computational complexity theory, was also characterized in logical terms as a result of investigations into descriptive complexity.