( en | de | ru )

 

Disambiguation of "Hitchcock, John M."

Author of the publication

copydeleteadd this publication to your clipboard
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws.

, , , , and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 335-345. Springer, (2006)

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. You can also use the button next to the name to display some publications already assigned to the person.

Peter Hitchcock

John M Sullivan

John M MacMahon

Ambrose Dyason Hitchcock

Simon M M Laimer

 

Other publications of authors with the same name

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