The following pages link to John M. Hitchcock (Q596116):
Displayed 50 items.
- The size of SPP (Q596117) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Dimension, halfspaces, and the density of hard sets (Q649114) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Correspondence principles for effective dimensions (Q814928) (← links)
- Entropy rates and finite-state dimension (Q817815) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Hardness hypotheses, derandomization, and circuit complexity (Q937197) (← links)
- Gales suffice for constructive dimension (Q1007560) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- Resource-bounded strong dimension versus resource-bounded category (Q1041791) (← links)
- Fractal dimension and logarithmic loss unpredictability. (Q1401414) (← links)
- Autoreducibility of NP-complete sets under strong hypotheses (Q1745961) (← links)
- MAX3SAT is exponentially hard to approximate if NP has positive dimension. (Q1853564) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Nondeterminisic sublinear time has measure 0 in P (Q1999993) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- Hausdorff dimension and oracle constructions (Q2369006) (← links)
- Why computational complexity requires stricter martingales (Q2432539) (← links)
- Base invariance of feasible dimension (Q2444767) (← links)
- Upward separations and weaker hypotheses in resource-bounded measure (Q2465636) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- Learning Reductions to Sparse Sets (Q2849914) (← links)
- Length-Increasing Reductions for PSPACE-Completeness (Q2849941) (← links)
- Kolmogorov Complexity in Randomness Extraction. (Q2920128) (← links)
- Kolmogorov Complexity in Randomness Extraction (Q2947554) (← links)
- (Q3113769) (← links)
- (Q3304139) (← links)
- Effective Strong Dimension in Algorithmic Information and Computational Complexity (Q3507516) (← links)
- Lower Bounds for Reducibility to the Kolmogorov Random Strings (Q3576206) (← links)
- Dimension, Halfspaces, and the Density of Hard Sets (Q3608839) (← links)
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (Q3613771) (← links)
- Comparing Reductions to NP-Complete Sets (Q3613782) (← links)
- (Q4449182) (← links)
- (Q4601894) (← links)
- Small Spans in Scaled Dimension (Q4651530) (← links)
- (Q4737188) (← links)
- (Q4737189) (← links)
- Limitations of Efficient Reducibility to the Kolmogorov Random Strings (Q4904457) (← links)
- Polynomial-Time Random Oracles and Separating Complexity Classes (Q5061877) (← links)
- Strong Reductions and Isomorphism of Complete Sets (Q5175618) (← links)
- On the NP-Completeness of the Minimum Circuit Size Problem. (Q5275370) (← links)
- The arithmetical complexity of dimension and randomness (Q5277778) (← links)
- Computer Science Logic (Q5292640) (← links)
- STACS 2004 (Q5309737) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311122) (← links)
- Online Learning and Resource‐Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets (Q5432367) (← links)
- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets (Q5449817) (← links)