Discover open access scientific publications

Search, annotate, share and cite publications

Publications by John M. Hitchcock

Limitations of Efficient Reducibility to the Kolmogorov Random Strings

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2012English

Strong Reductions and Isomorphism of Complete Sets

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2014English

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Upward Separations and Weaker Hypotheses in Resource-Bounded Measure

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

The Arithmetical Complexity of Dimension and Randomness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Hardness Hypotheses, Derandomization, and Circuit Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy