Hadi Shafei

Publication Activity (10 Years)

Years Active: 2016-2022
Publications (10 Years): 12

Top Topics

Complexity Bounds

Bounded Treewidth

Conjunctive Queries

Top Venues

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Theory

Publications

John M. Hitchcock, Hadi Shafei
Nonuniform Reductions and NP-Completeness. Theory Comput. Syst. 66 (4) (2022)
John M. Hitchcock, Adewale Sekoni, Hadi Shafei
Polynomial-Time Random Oracles and Separating Complexity Classes. ACM Trans. Comput. Theory 13 (1) (2021)
Hadi Shafei
Review of Kolmogorov Complexity and Algorithmic Randomness by A. Shen, V. A. Uspensky, and N. Vereshchagin. SIGACT News 50 (4) (2019)
John M. Hitchcock, Hadi Shafei
Autoreducibility of NP-Complete Sets under Strong Hypotheses. Comput. Complex. 27 (1) (2018)
John M. Hitchcock, Hadi Shafei
Nonuniform Reductions and NP-Completeness. STACS (2018)
John M. Hitchcock, Hadi Shafei
Nonuniform Reductions and NP-Completeness. Electron. Colloquium Comput. Complex. 25 (2018)
John M. Hitchcock, Adewale Sekoni, Hadi Shafei
Polynomial-Time Random Oracles and Separating Complexity Classes. CoRR (2018)
John M. Hitchcock, Hadi Shafei
Nonuniform Reductions and NP-Completeness. CoRR (2018)
John M. Hitchcock, Adewale Sekoni, Hadi Shafei
Polynomial-Time Random Oracles and Separating Complexity Classes. Electron. Colloquium Comput. Complex. 25 (2018)
John M. Hitchcock, Hadi Shafei
Autoreducibility of NP-Complete Sets. CoRR (2016)
John M. Hitchcock, Hadi Shafei
Autoreducibility of NP-Complete Sets. Electron. Colloquium Comput. Complex. 23 (2016)
John M. Hitchcock, Hadi Shafei
Autoreducibility of NP-Complete Sets. STACS (2016)