( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Descriptive Complexity of $\#AC^0$ Functions

, , , и . (2016)cite arxiv:1604.06617.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ernst Haak

Walter Haak

Manfred Haak

Jürgen Haak

Petra Haak

 

Другие публикации лиц с тем же именем

Enumerating teams in first-order team logics., , , и . Ann. Pure Appl. Log., 173 (10): 103163 (2022)Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth, , и . CoRR, (2017)Descriptive Complexity of $\#AC^0$ Functions, , , и . (2016)cite arxiv:1604.06617.Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth., , и . LICS, стр. 354-363. ACM, (2018)Counting of Teams in First-Order Team Logics., , , , и . MFCS, том 138 из LIPIcs, стр. 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parameterised Counting Classes with Bounded Nondeterminism., , , и . CoRR, (2019)Parameterised Counting in Logspace., , , и . STACS, том 187 из LIPIcs, стр. 40:1-40:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Descriptive complexity of circuit-based counting classes. University of Hanover, Germany, (2021)base-search.net (ftunivhannover:oai:www.repo.uni-hannover.de:123456789/11440).PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)., , , , , , и . IPEC, том 285 из LIPIcs, стр. 37:1-37:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Descriptive Complexity of #AC0 Functions., , , и . CSL, том 62 из LIPIcs, стр. 20:1-20:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)