- Dimension, Halfspaces, and the Density of Hard Sets # Ryan C. Harkins + John M. Hitchcock #
- Hausdorff Dimension and Oracle Constructions John M. Hitchcock
- SIGACT News Complexity Theory Column 48 Lane A. Hemaspaandra
- Dimension, Halfspaces, and the Density of Hard Sets Ryan C. Harkins
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
- Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
- Comparing Reductions to NP-Complete Sets John M. Hitchcock
- Upward Separations and Weaker Hypotheses in Resource-Bounded Measure
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Dimension, Entropy Rates, and Compression John M. Hitchcock
- Correspondence Principles for Effective John M. Hitchcock
- The Size of SPP John M. Hitchcock
- Fractal Dimension and Logarithmic Loss Unpredictability
- Effective fractal dimension: foundations and applications John M. Hitchcock
- Resource-bounded dimension, nonuniform complexity, and approximation of John Matthew Hitchcock
- ResourceBounded Strong Dimension versus ResourceBounded Category
- Resourcebounded dimension, nonuniform complexity, and approximation John Matthew Hitchcock
- Strong Reductions and Isomorphism of Complete Sets
- ResourceBounded Dimension, Nonuniform Complexity, and Approximation of MAX3SAT
- Why Computational Complexity Requires Stricter Martingales #
- Scaled Dimension and Nonuniform Complexity John M. Hitchcock
- Small Spans in Scaled Dimension John M. Hitchcock
- The Arithmetical Complexity of Dimension and Randomness #
- NPHard Sets are Exponentially Dense Unless coNP # NP/poly Harry Buhrman # John M. Hitchcock +
- Strong Reductions and Isomorphism of Complete Sets
- Resource-Bounded Strong Dimension versus Resource-Bounded Category
- Online Learning and ResourceBounded Dimension: Winnow Yields New Lower Bounds for Hard Sets #
- E#ective Fractal Dimension: Foundations and Applications John M. Hitchcock
- Dimension, Entropy Rates, and Compression John M. Hitchcock #
- Partial Bi-immunity, Scaled Dimension, and NP-Completeness
- Comparing Reductions to NPComplete Sets John M. Hitchcock # A. Pavan +
- Hardness Hypotheses, Derandomization, and Circuit Complexity
- Entropy Rates and Finite-State Dimension Chris Bourke
- Effective Fractal Dimension: Foundations and Applications John M. Hitchcock
- Gales Suffice for Constructive Dimension John M. Hitchcock
- Upward Separations and Weaker Hypotheses in ResourceBounded Measure #
- Hardness Hypotheses, Derandomization, and Circuit Complexity
- Extracting Kolmogorov Complexity with Applications to Dimension ZeroOne Laws
- Partial Bi-immunity and NP-Completeness John M. Hitchcock A. Pavan y N. V. Vinodchandran z
- The Size of SPP John M. Hitchcock #
- Entropy Rates and FiniteState Dimension Chris Bourke # John M. Hitchcock + N. V. Vinodchandran #
- Why Computational Complexity Requires Stricter Martingales
- Small Spans in Scaled Dimension John M. Hitchcock #
- Fractal Dimension and Logarithmic Loss Unpredictability #
- MAX3SAT Is Exponentially Hard to Approximate If NP Has Positive Dimension
- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
- Scaled Dimension and Nonuniform Complexity John M. Hitchcock #
- Gales Suce for Constructive Dimension John M. Hitchcock
- Kolmogorov Complexity in Randomness Extraction John M. Hitchcock1
- Resource-Bounded Dimension, Nonuniform Complexity, and Approximation of MAX3SAT
- Lower Bounds for Reducibility to the Kolmogorov Random Strings
- NP-Hard Sets are Exponentially Dense Unless coNP NP/poly Harry Buhrman
- Correspondence Principles for E#ective Dimensions #
- E#ective Strong Dimension in Algorithmic Information and Computational Complexity
- SIGACT News Complexity Theory Column 48 Lane A. Hemaspaandra
- Scaled Dimension and the Kolmogorov Complexity of TuringHard Sets
- Hausdor# Dimension and Oracle Constructions # John M. Hitchcock
- MAX3SAT Is Exponentially Hard to Approximate If NP Has Positive Dimension #
- Partial Biimmunity, Scaled Dimension, and NPCompleteness
- E#ective fractal dimension: foundations and applications John M. Hitchcock
- The Arithmetical Complexity of Dimension and John M. Hitchcock