| Size-degree trade-offs for sums-of-squares and Positivstellensatz proofs A Atserias, T Hakoniemi arXiv preprint arXiv:1811.01351, 2018 | 27 | 2018 |
| Simple hard instances for low-depth algebraic proofs N Govindasamy, T Hakoniemi, I Tzameret 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 4 | 2022 |
| Labelled tableaux for interpretability logics TA Hakoniemi, JJ Joosten arXiv preprint arXiv:1605.05612, 2016 | 4 | 2016 |
| Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus T Hakoniemi 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-7, 2021 | 3 | 2021 |
| Feasible interpolation for polynomial calculus and sums-of-squares T Hakoniemi 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 3 | 2020 |
| Size bounds for algebraic and semialgebraic proof systems TA Hakoniemi Universitat Politècnica de Catalunya, 2022 | 2 | 2022 |
| Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers T Hakoniemi, N Limaye, I Tzameret | | 2024 |
| IMTech S Fernández, J Díaz, J Guàrdia, JM Rossell, N Salán, I Zaplana, V Rotger, ... | | 2022 |
| Size-degree trade-offs for Sums-of-Squares and Positivstellensatz proofs T Hakoniemi, A Atserias 34th Computational Complexity Conference, CCC 2019, 2019 | | 2019 |
| Protoalgebraic and Equivalential Logics T Hakoniemi Helsingfors universitet, 2016 | | 2016 |
