Travelled to:1 × Austria
1 × Italy
1 × Spain
1 × Switzerland
1 × The Netherlands
Collaborated with:J.H.Lutz A.Pavan R.C.Harkins ∅ S.Terwijn E.Mayordomo L.Fortnow N.V.Vinodchandran F.Wang
Talks about:complex (4) dimens (4) nonuniform (1) kolmogorov (1) correspond (1) martingal (1) algorithm (1) stricter (1) principl (1) arithmet (1)
Person: John M. Hitchcock
DBLP: Hitchcock:John_M=
Contributed to:
20112006
200320032002Wrote 7 papers:
- ICALP-v1-2011-HarkinsH #algorithm #bound #game studies #learning
- Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (RCH, JMH), pp. 416–423.
- ICALP-v1-2006-FortnowHPVW #complexity
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (LF, JMH, AP, NVV, FW), pp. 335–345.
- ICALP-v1-2006-HitchcockP #reduction #set
- Comparing Reductions to NP-Complete Sets (JMH, AP), pp. 465–476.
- CSL-2003-HitchcockLT #complexity
- The Arithmetical Complexity of Dimension and Randomness (JMH, JHL, ST), pp. 241–254.
- ICALP-2003-HitchcockLM #complexity
- Scaled Dimension and Nonuniform Complexity (JMH, JHL, EM), pp. 278–290.
- ICALP-2002-Hitchcock #effectiveness
- Correspondence Principles for Effective Dimensions (JMH), pp. 561–571.
- ICALP-2002-HitchcockL #complexity #strict #why
- Why Computational Complexity Requires Stricter Martingales (JMH, JHL), pp. 549–560.