( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Komplexität von Algorithmen.

, и . Mathematik für Anwendungen Lehmanns Media, (2015)

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.

Heribert Vollmer

Heribert Vollmer

Siegfried Vollmer

Gregor Vollmer

Norbert Vollmer

 

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

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics., , , и . ACM Trans. Comput. Log., 21 (1): 7:1-7:18 (2020)A Logical Characterization of Constant-Depth Circuits over the Reals., и . WoLLIC, том 13038 из Lecture Notes in Computer Science, стр. 16-30. Springer, (2021)06401 Abstracts Collection - Complexity of Constraints., , и . Complexity of Constraints, том 06401 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)On the Autoreducibility of Random Sequences., и . Technical Report, 239. Department of Computer Science, (октября 1999)Arithmetic Circuits and Polynomial Replacement Systems., , и . Technical Report, 242. Department of Computer Science, (ноября 1999)Recursion Theoretic Characterizations of Complexity Classes of Counting Functions., и . Technical Report, 91. Department of Computer Science, (ноября 1994)A Van Benthem Theorem for Modal Team Semantics, , , и . 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, стр. 277--291. (2015)Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, и . 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), том 66 из Leibniz International Proceedings in Informatics (LIPIcs), стр. 0:i--0:xvi. Dagstuhl, Germany, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, (2017)Paradigms for Parameterized Enumeration, , , , и . Theory Comput. Syst., 60 (4): 737--758 (2017)Measure One Results in Computational Complexity Theory., и . Advances in Algorithms, Languages, and Complexity, стр. 285-312. Kluwer, (1997)