Tuomas Hakoniemi received his PhD in 2022 from Universitat Politècnica de Catalunya under the spervision of Prof. Albert Atserias. After graduation he worked as a postdoctoral researcher in the research group of Prof. Iddo Tzameret at Imperial College London. Since June 2023 Hakoniemi has worked as a HIIT postdoctoral fellow at the University of Helsinki under the supervision of Prof. Mikko Koivisto.
Hakoniemi’s research interests lie in the intersection of theoretical computer science and mathematical logic. He is interested in the limits of models of computation and methods of reasoning and the interplay between the two. Much of his work has focused on the proof complexity of various algebraic proof systems.
Sample of publications:
1] Tuomas Hakoniemi, Nutan Limaye, and Iddo Tzameret. 2024. Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024). Association for Computing Machinery, New York, NY, USA, 1396–1404.
[2] N. Govindasamy, T. Hakoniemi, & I. Tzameret. (2022). Simple Hard Instances for Low-Depth Algebraic Proofs. In Proceedings – 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 (pp. 188-199). IEEE Computer Society.
[3] T. Hakoniemi. Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus. 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Rome, Italy, 2021, pp. 1-7.