Anselm Haak
Title
Cited by
Cited by
Year
A model-theoretic characterization of constant-depth arithmetic circuits
A Haak, H Vollmer
Annals of Pure and Applied Logic 170 (9), 1008-1029, 2019
62019
Descriptive Complexity of Functions
A Durand, A Haak, J Kontinen, H Vollmer
arXiv preprint arXiv:1604.06617, 2016
52016
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
42019
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
32018
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
2021
Enumerating Teams in First-Order Team Logics
A Haak, A Meier, F Müller, H Vollmer
arXiv preprint arXiv:2006.06953, 2020
2020
Parameterised Counting in Logspace
A Haak, A Meier, O Prakash, BV Rao
arXiv preprint arXiv:1904.12156, 2019
2019
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
The system can't perform the operation now. Try again later.
Articles 1–11