( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Locality from Circuit Lower Bounds.

, , , и . Electron. Colloquium Comput. Complex., (2011)

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.

Dieter Melkebeek

Dieter van Leyen

Dieter van Leyen

Huynh Van Van

Eligius Vancek

 

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

Special Issue "Conference on Computational Complexity 2010" Guest Editor's Foreword.. Comput. Complex., 20 (2): 173-175 (2011)A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)., , , , и . STACS, том 1373 из Lecture Notes in Computer Science, стр. 161-171. Springer, (1998)Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011)., , , , и . SIAM J. Comput., 41 (5): 1233-1234 (2012)Hard Sets Are Hard to Find., и . J. Comput. Syst. Sci., 59 (2): 327-345 (1999)A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem, , , , и . Electron. Colloquium Comput. Complex., (1998)Minimum Circuit Size, Graph Isomorphism, and Related Problems., , , , и . Electron. Colloquium Comput. Complex., (2017)Hard Sets are Hard to Find., и . CCC, стр. 170-181. IEEE Computer Society, (1998)Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games., и . CCC, стр. 269-279. IEEE Computer Society, (2012)Space Hierarchy Results for Randomized Models., и . STACS, том 1 из LIPIcs, стр. 433-444. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Locality from Circuit Lower Bounds., , , и . SIAM J. Comput., 41 (6): 1481-1523 (2012)