( en | de | ru )

 

Disambiguation of "Vollmer, Heribert"

Author of the publication

copydeleteadd this publication to your clipboard
Descriptive Complexity of $\#AC^0$ Functions

, , , and . (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. You can also use the button next to the name to display some publications already assigned to the person.

Heribert Vollmer

Heribert Vollmer

Siegfried Vollmer

Gregor Vollmer

Norbert Vollmer

 

Other publications of authors with the same name

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics., , , and . ACM Trans. Comput. Log., 21 (1): 7:1-7:18 (2020)A Logical Characterization of Constant-Depth Circuits over the Reals., and . WoLLIC, volume 13038 of Lecture Notes in Computer Science, page 16-30. Springer, (2021)06401 Abstracts Collection - Complexity of Constraints., , and . Complexity of Constraints, volume 06401 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)Nondeterministic NC1 Computation., , , and . CCC, page 12-21. IEEE Computer Society, (1996)Descriptive Complexity of #AC0 Functions., , , and . CSL, volume 62 of LIPIcs, page 20:1-20:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Measure One Results in Computational Complexity Theory., and . Advances in Algorithms, Languages, and Complexity, page 285-312. Kluwer, (1997)A Van Benthem Theorem for Modal Team Semantics, , , and . 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, page 277--291. (2015)On the Autoreducibility of Random Sequences., and . Technical Report, 239. Department of Computer Science, (October 1999)Arithmetic Circuits and Polynomial Replacement Systems., , and . Technical Report, 242. Department of Computer Science, (November 1999)Recursion Theoretic Characterizations of Complexity Classes of Counting Functions., and . Technical Report, 91. Department of Computer Science, (November 1994)