Counting of teams in first-order team logics A Haak, J Kontinen, F Müller, H Vollmer, F Yang
arXiv preprint arXiv:1902.00246, 2019
9 2019 A model-theoretic characterization of constant-depth arithmetic circuits A Haak, H Vollmer
Annals of Pure and Applied Logic 170 (9), 1008-1029, 2019
8 2019 Descriptive complexity of# P functions: A new perspective A Durand, A Haak, J Kontinen, H Vollmer
Journal of Computer and System Sciences 116, 40-54, 2021
7 2021 Descriptive Complexity of Functions A Durand, A Haak, J Kontinen, H Vollmer
arXiv preprint arXiv:1604.06617, 2016
6 2016 Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth A Durand, A Haak, H Vollmer
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
5 2018 Enumerating teams in first-order team logics A Haak, A Meier, F Müller, H Vollmer
Annals of Pure and Applied Logic 173 (10), 103163, 2022
4 2022 Parameterised counting in logspace A Haak, A Meier, O Prakash, BVR Rao
Algorithmica 85 (10), 2923-2961, 2023
1 2023 PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM) A Leonhardt, H Dell, A Haak, F Kammer, J Meintrup, U Meyer, ...
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 2023
2023 Descriptive complexity of circuit-based counting classes A Haak
Hannover: Institutionelles Repositorium der Leibniz Universität Hannover, 2021
2021 Parameterised Counting Classes: Tail Versus Reductions A Haak, A Meier, O Prakash, RR BV
arXiv preprint arXiv:1904.12156, 2019
2019 Complexity of Parameterized Counting A Haak
2015 Komplexität der Matrizen-Multiplikation A Haak
2013 Characterizing Circuit Complexity Classes by Logics with Recursion A Haak