Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Anselm Haak, Arne Meier, Om Prakash, and Raghavendra Rao B. V.. Parameterised Counting in Logspace. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 40:1-40:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{haak_et_al:LIPIcs.STACS.2021.40, author = {Haak, Anselm and Meier, Arne and Prakash, Om and Rao B. V., Raghavendra}, title = {{Parameterised Counting in Logspace}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {40:1--40:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.40}, URN = {urn:nbn:de:0030-drops-136859}, doi = {10.4230/LIPIcs.STACS.2021.40}, annote = {Keywords: Parameterized Complexity, Counting Complexity, Logspace} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, and Fan Yang. Counting of Teams in First-Order Team Logics. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 19:1-19:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{haak_et_al:LIPIcs.MFCS.2019.19, author = {Haak, Anselm and Kontinen, Juha and M\"{u}ller, Fabian and Vollmer, Heribert and Yang, Fan}, title = {{Counting of Teams in First-Order Team Logics}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.19}, URN = {urn:nbn:de:0030-drops-109634}, doi = {10.4230/LIPIcs.MFCS.2019.19}, annote = {Keywords: team-based logics, counting classes, finite model theory, descriptive complexity} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Arnaud Durand, Anselm Haak, Juha Kontinen, and Heribert Vollmer. Descriptive Complexity of #AC^0 Functions. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 20:1-20:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{durand_et_al:LIPIcs.CSL.2016.20, author = {Durand, Arnaud and Haak, Anselm and Kontinen, Juha and Vollmer, Heribert}, title = {{Descriptive Complexity of #AC^0 Functions}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.20}, URN = {urn:nbn:de:0030-drops-65601}, doi = {10.4230/LIPIcs.CSL.2016.20}, annote = {Keywords: finite model theory, Fagin's theorem, arithmetic circuits, counting classes, Skolem function} }
Feedback for Dagstuhl Publishing