( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Autoreducibility of NP-Complete Sets under Strong Hypotheses.

, и . Comput. Complex., 27 (1): 63-97 (2018)

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.

Peter Hitchcock

John M Sullivan

John M MacMahon

Ambrose Dyason Hitchcock

Simon M M Laimer

 

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

Small Spans in Scaled Dimension. CoRR, (2003)The Size of SPP. Electron. Colloquium Comput. Complex., (2003)Hardness Hypotheses, Derandomization, and Circuit Complexity., и . Electron. Colloquium Comput. Complex., (2006)Nonuniform Reductions and NP-Completeness., и . STACS, том 96 из LIPIcs, стр. 40:1-40:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds., , , и . Comput. Complex., 20 (2): 329-366 (2011)Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets., , и . MFCS, том 3153 из Lecture Notes in Computer Science, стр. 476-487. Springer, (2004)Length-Increasing Reductions for PSPACE-Completeness., и . MFCS, том 8087 из Lecture Notes in Computer Science, стр. 540-550. Springer, (2013)Strong Reductions and Isomorphism of Complete Sets., , и . Comput., 3 (2): 91-104 (2014)MAX3SAT is exponentially hard to approximate if NP has positive dimension.. Theor. Comput. Sci., 289 (1): 861-869 (2002)Hausdorff Dimension and Oracle Constructions. Electron. Colloquium Comput. Complex., (2004)