Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Haak, Anselm
23  Ergebnisse:
Personensuche X
?
1

Parameterised Counting in Logspace:

Haak, Anselm ; Meier, Arne ; Prakash, Om.
Algorithmica.  85 (2023)  10 - p. 2923-2961 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Enumerating teams in first-order team logics:

Haak, Anselm ; Meier, Arne ; Müller, Fabian.
Annals of Pure and Applied Logic.  173 (2022)  10 - p. 103163 , 2022
Link: https://doi.org/10.1016/..
 
?
3

Descriptive complexity of #P functions: A new perspective:

Durand, Arnaud ; Haak, Anselm ; Kontinen, Juha.
Journal of Computer and System Sciences.  116 (2021)  - p. 40-54 , 2021
Link: https://doi.org/10.1016/..
 
?
4

A model-theoretic characterization of constant-depth arithm..:

Haak, Anselm ; Vollmer, Heribert
Annals of Pure and Applied Logic.  170 (2019)  9 - p. 1008-1029 , 2019
Link: https://doi.org/10.1016/..
 
?
5

Model-Theoretic Characterization of Boolean and Arithmetic ..:

, In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
Durand, Arnaud ; Haak, Anselm ; Vollmer, Heribert - p. 354-363 , 2018
Link: https://dl.acm.org/doi/1..
 
?
6

GUTHM and GUTHMi: Exact and heurstic twin-width solvers:

Dell, Holger ; Haak, Anselm ; Kammer, Frank...
doi:10.5281/zenodo.7996073.  , 2023
Link: https://zenodo.org/recor..
 
?
7

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTH..:

Leonhardt, Alexander ; Dell, Holger ; Haak, Anselm...
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
8

Parameterised Counting in Logspace:

Haak, Anselm ; Meier, Arne ; Prakash, Om.
DOI:https://doi.org/10.1007/s00453-023-01114-2.  , 2023
Link: https://www.repo.uni-han..
 
?
9

Parameterised Counting in Logspace:

Haak, Anselm ; Meier, Arne ; Prakash, Om.
doi:10.4230/LIPIcs.STACS.2021.40.  , 2021
Link: https://doi.org/10.4230/..
 
?
10

Descriptive complexity of circuit-based counting classes:

Haak, Anselm
http://dx.doi.org/10.15488/11353.  , 2021
Link: https://www.repo.uni-han..
 
?
11

Descriptive complexity of #P functions : A new perspective:

Durand, Arnaud ; Haak, Anselm ; Kontinen, Juha.
10.1016/j.jcss.2020.04.002.  , 2020
Link: http://hdl.handle.net/10..
 
?
12

Enumerating Teams in First-Order Team Logics:

Haak, Anselm ; Meier, Arne ; Müller, Fabian.
http://arxiv.org/abs/2006.06953.  , 2020
Link: http://arxiv.org/abs/200..
 
?
13

Counting of Teams in First-Order Team Logics:

Haak, Anselm ; Kontinen, Juha ; Müller, Fabian..
10.4230/LIPIcs.MFCS.2019.19.  , 2019
Link: http://hdl.handle.net/10..
 
?
14

Counting of Teams in First-Order Team Logics:

Haak, Anselm ; Kontinen, Juha ; Müller, Fabian..
Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019).  , 2019
Link: https://doi.org/10.4230/..
 
?
15

Parameterised Counting in Logspace:

Haak, Anselm ; Meier, Arne ; Prakash, Om.
http://arxiv.org/abs/1904.12156.  , 2019
Link: http://arxiv.org/abs/190..
 
1-15