( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006).

, , , , , и . SIAM J. Comput., 39 (1): vii (2009)

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

Christoph Vannahme

 

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

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)., , , , и . STACS, том 1373 из Lecture Notes in Computer Science, стр. 161-171. Springer, (1998)Minimum Circuit Size, Graph Isomorphism, and Related Problems., , , , и . Electron. Colloquium Comput. Complex., (2017)Space Hierarchy Results for Randomized Models., и . STACS, том 1 из LIPIcs, стр. 433-444. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)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)Language compression and pseudorandom generators., , и . Comput. Complex., 14 (3): 228-255 (2005)Query Complexity of Inversion Minimization on Trees., , и . SODA, стр. 2836-2866. SIAM, (2023)Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines., и . Complexity of Boolean Functions, том 06111 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses., и . SIAM J. Comput., 31 (5): 1501-1526 (2002)Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines., и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 982-993. Springer, (2005)