Heribert Vollmer

A logical characterization of constant-depth circuits over the reals
Barlag, T. & Vollmer, H., Sept 2025, In: Journal of logic and computation. 35, 6, exae051.
Research output: Contribution to journal › Article › Research › peer review
Graph Neural Networks and Arithmetic Circuits
Barlag, T., Holzapfel, V., Strieker, L., Virtema, J. & Vollmer, H., 2024, In: Advances in Neural Information Processing Systems. 37
Research output: Contribution to journal › Conference article › Research › peer review

Open Access
Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111)
Kontinen, J., Virtema, J., Vollmer, H., Yang, F. & Fröhlich, N., 19 Sept 2024, In: Dagstuhl Reports. 14, 3, p. 31-51 21 p., 3.
Research output: Contribution to journal › Article › Research › peer review

Open Access
Parameterized complexity of weighted team definability
Kontinen, J., Mahmood, Y., Meier, A. & Vollmer, H., May 2024, In: Mathematical Structures in Computer Science. 34, 5, p. 375-389 15 p.
Research output: Contribution to journal › Article › Research › peer review

Open Access
Special issue on logic and complexity
Creignou, N., Durand, A. & Vollmer, H., May 2024, In: Mathematical Structures in Computer Science. 34, p. 344-345 2 p.
Research output: Contribution to journal › Editorial in journal › Research › peer review

Applications and complexity of logics in semiring team semantics
Meier, A. (Principal Investigator), Vollmer, H. (Project staff), Barlag, T. (Project staff), Fröhlich, N. F. H. (Project staff), Holzapfel, V. (Project staff) & Strieker, L. (Project staff)
1 Jan 2024 → 31 Dec 2025
Project: Research
34th International Symposium on Theoretical Aspects of Computer Science (STACS) 2017, Hannover, 08.03.17 - 11.03.17
Vollmer, H. (Principal Investigator)
27 Sept 2016 → 31 Mar 2017
Project: Research
Arithmetic versus Boolean Complexity: The Case of Small-Depth Circuits
Vollmer, H. (Principal Investigator)
1 Nov 2015 → 1 Jan 2019
Project: Research

Research output