John M. Hitchcock

ScholarGPS® ID: 57245453647337

Affiliation
University of Wyoming, Laramie, United States
Affiliation History

Field
Engineering and Computer Science
Discipline
Computer Science
Top Specialties
Combinatorics | Logic
Metrics Summary
Publication Count
64
Predicted Citations
870
Predicted h-index
17
Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

  • Publications
  • Books
  • Patents
  • NIH/NSF
You must register and claim your profile to add or remove publications from it.
... publications
FILTER BY:
Year
Type
Specialty
Affiliations
Access
Co-Authors
Add
Delete
Nonuniform Reductions and NP-Completeness (journal article)
Hitchcock, John M. | Shafei, Hadi
Theory of Computing Systems, volume 66, issue 4, pages 743-757 (2022).
10.1007/s00224-022-10083-y
Cited by (1) | Cite | Source
Polynomial-Time Random Oracles and Separating Complexity Classes (journal article)
Hitchcock, John M. | Sekoni, Adewale | Shafei, Hadi
ACM Transactions on Computation Theory, volume 13, issue 1, pages 11-16 (2021).
10.1145/3434389
Cite | Source
Nondeterminisic Sublinear Time Has Measure 0 in P (journal article)
Hitchcock, John M. | Sekoni, Adewale
Theory of Computing Systems, volume 63, issue 3, pages 386-393 (2019).
10.1007/s00224-018-9875-0
Cite | Source | Open Access
Autoreducibility of NP-Complete Sets under Strong Hypotheses (journal article)
Hitchcock, John M. | Shafei, Hadi
computational complexity, volume 27, issue 1, pages 63-97 (2018).
10.1007/s00037-017-0157-z
Cited by (1) | Cite | Source
Nonuniform Reductions and NP-Completeness. (conference)
Hitchcock, John M. | Shafei, Hadi
Symposium on Theoretical Aspects of Computer Science (2018)
10.4230/LIPIcs.STACS.2018.40
Cite | Source
Autoreducibility of NP-Complete Sets (conference)
Hitchcock, John M. | Shafei, Hadi
Symposium on Theoretical Aspects of Computer Science (2016)
Orléans, France
10.4230/LIPIcs.STACS.2016.42
Cite | Source
On the NP-Completeness of the Minimum Circuit Size Problem (conference)
Hitchcock, John M. | Pavan, Aduri
Foundations of Software Technology and Theoretical Computer Science (2015)
Bangalore, India
10.4230/LIPIcs.FSTTCS.2015.236
Cited by (15) | Cite | Source
Unions of Disjoint NP-Complete Sets (journal article)
Glaßer, Christian | Hitchcock, John M. | Pavan, A. | Travers, Stephan
ACM Transactions on Computation Theory, volume 6, issue 1, pages 1-10 (2014).
10.1145/2591508
Cite | Source | Open Access
Strong Reductions and Isomorphism of Complete Sets (journal article)
Harkins, Ryan C. | Hitchcock, John M. | Pavan, A.
Computability, volume 3, issue 2, pages 91-104 (2014).
10.3233/COM-140028
Cited by (1) | Cite | Source
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (journal article)
Harkins, Ryan C. | Hitchcock, John M.
ACM Transactions on Computation Theory, volume 5, issue 4, pages 1-11 (2013).
10.1145/2539126.2539130
Cited by (7) | Cite | Source
Base invariance of feasible dimension (journal article)
Hitchcock, John M. | Mayordomo, Elvira
Information Processing Letters, volume 113, issue 14-16, pages 546-551 (2013).
10.1016/j.ipl.2013.04.004
Cited by (3) | Cite | Source | Open Access
Learning Reductions to Sparse Sets (book chapter)
In Mathematical Foundations of Computer Science 2013
Buhrman, Harry | Fortnow, Lance | Hitchcock, John M. | Loff, Bruno
Springer Berlin Heidelberg (2013)
10.1007/978-3-642-40313-2_23
Cited by (1) | Cite | Source | Open Access
Length-Increasing Reductions for PSPACE-Completeness (book chapter)
In Mathematical Foundations of Computer Science 2013
Hitchcock, John M. | Pavan, A.
Springer Berlin Heidelberg (2013)
10.1007/978-3-642-40313-2_48
Cite | Source | Open Access
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses (journal article)
Gu, Xiaoyang | Hitchcock, John M. | Pavan, A.
Theory of Computing Systems, volume 51, issue 2, pages 248-265 (2012).
10.1007/s00224-011-9365-0
Cited by (4) | Cite | Source | Open Access
Limitations of Efficient Reducibility to the Kolmogorov Random Strings (journal article)
Hitchcock, John M.
Computability, volume 1, issue 1, pages 39-43 (2012).
10.3233/COM-2012-006
Cited by (1) | Cite | Source
Dimension, Halfspaces, and the Density of Hard Sets (journal article)
Harkins, Ryan C. | Hitchcock, John M.
Theory of Computing Systems, volume 49, issue 3, pages 601-614 (2011).
10.1007/s00224-010-9288-1
Cited by (3) | Cite | Source | Open Access
Kolmogorov Complexity in Randomness Extraction (journal article)
Hitchcock, John M. | Pavan, A. | Vinodchandran, N. V.
ACM Transactions on Computation Theory, volume 3, issue 1, pages 1-12 (2011).
10.1145/2003685.2003686
Cited by (13) | Cite | Source | Open Access
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds (journal article)
Aydınlıog̃lu, Barış | Gutfreund, Dan | Hitchcock, John M. | Kawachi, Akinori
computational complexity, volume 20, issue 2, pages 329-366 (2011).
10.1007/s00037-011-0010-8
Cited by (9) | Cite | Source | Open Access
Extracting Kolmogorov complexity with applications to dimension zero-one laws (journal article)
Fortnow, Lance | Hitchcock, John M. | Pavan, A. | Vinodchandran, N.V. | Wang, Fengming
Information and Computation, volume 209, issue 4, pages 627-636 (2011).
10.1016/j.ic.2010.09.006
Cited by (9) | Cite | Source | Open Access
Unions of Disjoint NP-Complete Sets (book chapter)
In Computing and Combinatorics
Glaßer, Christian | Hitchcock, John M. | Pavan, A. | Travers, Stephen
Springer Berlin Heidelberg (2011)
10.1007/978-3-642-22685-4_22
Cite | Source | Open Access