( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Note on the Power of Quasipolynomial Size Circuits.

. Technical Report, 140. Department of Computer Science, (июня 1996)

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

 

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

Measure One Results in Computational Complexity Theory., и . Advances in Algorithms, Languages, and Complexity, стр. 285-312. Kluwer, (1997)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)Complexity Results for Modal Dependence Logic, и . CoRR, (2011)Uniform characterizations of complexity classes.. SIGACT News, 30 (1): 17-27 (1999)Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071)., , , и . Dagstuhl Reports, 3 (2): 45-54 (2013)A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits., и . WoLLIC, том 9803 из Lecture Notes in Computer Science, стр. 234-248. Springer, (2016)On the Autoreducibility of Random Sequences., и . MFCS, том 1893 из Lecture Notes in Computer Science, стр. 333-342. Springer, (2000)Generic separations and leaf languages., , и . Math. Log. Q., 49 (4): 353-362 (2003)