Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn M. Hitchcock
Person information
- affiliation: University of Wyoming, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j34]John M. Hitchcock
, Hadi Shafei:
Nonuniform Reductions and NP-Completeness. Theory Comput. Syst. 66(4): 743-757 (2022)- 2021
- [j33]John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
Polynomial-Time Random Oracles and Separating Complexity Classes. ACM Trans. Comput. Theory 13(1): 11-16 (2021)
2010 – 2019
- 2019
- [j32]John M. Hitchcock, Adewale Sekoni:
Nondeterminisic Sublinear Time Has Measure 0 in P. Theory Comput. Syst. 63(3): 386-393 (2019) - 2018
- [j31]John M. Hitchcock, Hadi Shafei:
Autoreducibility of NP-Complete Sets under Strong Hypotheses. Comput. Complex. 27(1): 63-97 (2018) - [c26]John M. Hitchcock, Hadi Shafei:
Nonuniform Reductions and NP-Completeness. STACS 2018: 40:1-40:13 - [i26]John M. Hitchcock, Hadi Shafei:
Nonuniform Reductions and NP-Completeness. CoRR abs/1801.05882 (2018) - [i25]John M. Hitchcock, Adewale Sekoni:
Nondeterminisic Sublinear Time Has Measure 0 in P. CoRR abs/1801.05884 (2018) - [i24]John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
Polynomial-Time Random Oracles and Separating Complexity Classes. CoRR abs/1801.07317 (2018) - [i23]John M. Hitchcock, Hadi Shafei:
Nonuniform Reductions and NP-Completeness. Electron. Colloquium Comput. Complex. TR18 (2018) - [i22]John M. Hitchcock, Adewale Sekoni:
Nondeterminisic Sublinear Time Has Measure 0 in P. Electron. Colloquium Comput. Complex. TR18 (2018) - [i21]John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
Polynomial-Time Random Oracles and Separating Complexity Classes. Electron. Colloquium Comput. Complex. TR18 (2018) - 2016
- [c25]John M. Hitchcock, Hadi Shafei:
Autoreducibility of NP-Complete Sets. STACS 2016: 42:1-42:12 - [i20]John M. Hitchcock, Hadi Shafei:
Autoreducibility of NP-Complete Sets. CoRR abs/1601.05494 (2016) - [i19]John M. Hitchcock, Hadi Shafei:
Autoreducibility of NP-Complete Sets. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c24]John M. Hitchcock, Aduri Pavan:
On the NP-Completeness of the Minimum Circuit Size Problem. FSTTCS 2015: 236-245 - 2014
- [j30]Ryan C. Harkins, John M. Hitchcock, Aduri Pavan:
Strong Reductions and Isomorphism of Complete Sets. Comput. 3(2): 91-104 (2014) - [j29]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory 6(1): 3:1-3:10 (2014) - 2013
- [j28]John M. Hitchcock, Elvira Mayordomo:
Base invariance of feasible dimension. Inf. Process. Lett. 113(14-16): 546-551 (2013) - [j27]Ryan C. Harkins, John M. Hitchcock:
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds. ACM Trans. Comput. Theory 5(4): 18:1-18:11 (2013) - [c23]Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff:
Learning Reductions to Sparse Sets. MFCS 2013: 243-253 - [c22]John M. Hitchcock, Aduri Pavan:
Length-Increasing Reductions for PSPACE-Completeness. MFCS 2013: 540-550 - 2012
- [j26]John M. Hitchcock:
Limitations of Efficient Reducibility to the Kolmogorov Random Strings. Comput. 1(1): 39-43 (2012) - [j25]Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses. Theory Comput. Syst. 51(2): 248-265 (2012) - 2011
- [j24]Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi:
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Comput. Complex. 20(2): 329-366 (2011) - [j23]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209(4): 627-636 (2011) - [j22]Ryan C. Harkins, John M. Hitchcock:
Dimension, Halfspaces, and the Density of Hard Sets. Theory Comput. Syst. 49(3): 601-614 (2011) - [j21]John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. ACM Trans. Comput. Theory 3(1): 1:1-1:12 (2011) - [c21]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. COCOON 2011: 240-251 - [c20]Ryan C. Harkins, John M. Hitchcock:
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds. ICALP (1) 2011: 416-423 - 2010
- [c19]John M. Hitchcock:
Lower Bounds for Reducibility to the Kolmogorov Random Strings. CiE 2010: 195-200 - [c18]Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. STACS 2010: 429-440 - [i18]Xiaoyang Gu, John M. Hitchcock, Aduri Pavan:
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. CoRR abs/1001.0117 (2010) - [i17]Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek:
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c17]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. FSTTCS 2009: 215-226 - [i16]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j20]John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. Comput. Complex. 17(1): 119-146 (2008) - [j19]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008) - [j18]John M. Hitchcock, María López-Valdés, Elvira Mayordomo:
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory Comput. Syst. 43(3-4): 471-497 (2008) - [c16]Harry Buhrman, John M. Hitchcock:
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly. CCC 2008: 1-7 - [i15]Harry Buhrman, John M. Hitchcock:
NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j17]John M. Hitchcock, Aduri Pavan:
Comparing reductions to NP-complete sets. Inf. Comput. 205(5): 694-706 (2007) - [j16]John M. Hitchcock:
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets. SIAM J. Comput. 36(6): 1696-1708 (2007) - [j15]Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension in Algorithmic Information and Computational Complexity. SIAM J. Comput. 37(3): 671-705 (2007) - [j14]Ryan C. Harkins, John M. Hitchcock:
Upward separations and weaker hypotheses in resource-bounded measure. Theor. Comput. Sci. 389(1-2): 162-171 (2007) - [j13]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The arithmetical complexity of dimension and randomness. ACM Trans. Comput. Log. 8(2): 13 (2007) - [c15]Ryan C. Harkins, John M. Hitchcock:
Dimension, Halfspaces, and the Density of Hard Sets. COCOON 2007: 129-139 - [c14]Ryan C. Harkins, John M. Hitchcock, Aduri Pavan:
Strong Reductions and Isomorphism of Complete Sets. FSTTCS 2007: 168-178 - 2006
- [j12]John M. Hitchcock, N. V. Vinodchandran:
Dimension, entropy rates, and compression. J. Comput. Syst. Sci. 72(4): 760-782 (2006) - [j11]John M. Hitchcock, Jack H. Lutz:
Why Computational Complexity Requires Stricter Martingales. Theory Comput. Syst. 39(2): 277-296 (2006) - [j10]John M. Hitchcock:
Hausdorff dimension and oracle constructions. Theor. Comput. Sci. 355(3): 382-388 (2006) - [c13]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) 2006: 335-345 - [c12]John M. Hitchcock, Aduri Pavan:
Comparing Reductions to NP-Complete Sets. ICALP (1) 2006: 465-476 - [c11]John M. Hitchcock:
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets. STACS 2006: 408-419 - [i14]John M. Hitchcock, Aduri Pavan:
Comparing Reductions to NP-Complete Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - [i13]John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j9]John M. Hitchcock, Aduri Pavan:
Resource-bounded strong dimension versus resource-bounded category. Inf. Process. Lett. 95(3): 377-381 (2005) - [j8]John M. Hitchcock:
Correspondence Principles for Effective Dimensions. Theory Comput. Syst. 38(5): 559-571 (2005) - [j7]Chris Bourke, John M. Hitchcock, N. V. Vinodchandran:
Entropy rates and finite-state dimension. Theor. Comput. Sci. 349(3): 392-406 (2005) - [i12]John M. Hitchcock:
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets. CoRR abs/cs/0512053 (2005) - [i11]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. Electron. Colloquium Comput. Complex. TR05 (2005) - [i10]John M. Hitchcock:
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j6]John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Scaled dimension and nonuniform complexity. J. Comput. Syst. Sci. 69(2): 97-122 (2004) - [j5]John M. Hitchcock:
Small Spans in Scaled Dimension. SIAM J. Comput. 34(1): 170-194 (2004) - [j4]John M. Hitchcock:
The size of SPP. Theor. Comput. Sci. 320(2-3): 495-503 (2004) - [c10]John M. Hitchcock:
Small Spans in Scaled Dimension. CCC 2004: 104-112 - [c9]John M. Hitchcock, N. V. Vinodchandran:
Dimension, Entropy Rates, and Compression. CCC 2004: 174-183 - [c8]John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran:
Partial Bi-immunity and NP-Completeness. CCC 2004: 198-203 - [c7]John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity. FSTTCS 2004: 336-347 - [c6]John M. Hitchcock, María López-Valdés, Elvira Mayordomo:
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. MFCS 2004: 476-487 - [c5]Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension in Algorithmic Information and Computational Complexity. STACS 2004: 632-643 - [i9]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. CoRR cs.LO/0408043 (2004) - [i8]John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam:
Partial Bi-Immunity and NP-Completeness. Electron. Colloquium Comput. Complex. TR04 (2004) - [i7]John M. Hitchcock, María López-Valdés, Elvira Mayordomo:
Scaled dimension and the Kolmogorov complexity of Turing hard sets. Electron. Colloquium Comput. Complex. TR04 (2004) - [i6]John M. Hitchcock:
Hausdorff Dimension and Oracle Constructions. Electron. Colloquium Comput. Complex. TR04 (2004) - [i5]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j3]John M. Hitchcock:
Gales suffice for constructive dimension. Inf. Process. Lett. 86(1): 9-12 (2003) - [j2]John M. Hitchcock:
Fractal dimension and logarithmic loss unpredictability. Theor. Comput. Sci. 304(1-3): 431-441 (2003) - [c4]John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness. CSL 2003: 241-254 - [c3]John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Scaled Dimension and Nonuniform Complexity. ICALP 2003: 278-290 - [i4]John M. Hitchcock:
Small Spans in Scaled Dimension. CoRR cs.CC/0304030 (2003) - [i3]John M. Hitchcock:
The Size of SPP. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j1]John M. Hitchcock:
MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theor. Comput. Sci. 289(1): 861-869 (2002) - [c2]John M. Hitchcock, Jack H. Lutz:
Why Computational Complexity Requires Stricter Martingales. ICALP 2002: 549-560 - [c1]John M. Hitchcock:
Correspondence Principles for Effective Dimensions. ICALP 2002: 561-571 - [i2]John M. Hitchcock:
Gales Suffice for Constructive Dimension. CoRR cs.CC/0208043 (2002) - [i1]Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension, Algorithmic Information, and Computational Complexity. CoRR cs.CC/0211025 (2002)
Coauthor Index
aka: N. Variyam Vinodchandran
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
