Shuichi Hirahara

From MaRDI portal
Person:1751255

Available identifiers

zbMath Open hirahara.shuichiMaRDI QIDQ1751255

List of research outcomes





PublicationDate of PublicationType
Bounded relativization2024-11-19Paper
One-tape Turing machine and branching program lower bounds for MCSP2024-10-07Paper
Kolmogorov complexity characterizes statistical zero knowledge2024-09-25Paper
Learning versus pseudorandom generators in constant parallel time2024-09-25Paper
Finding errorless pessiland in error-prone heuristica2024-07-05Paper
Symmetry of information from meta-complexity2024-07-05Paper
Hardness self-amplification: simplified, optimized, and unified2024-05-08Paper
Capturing one-way functions via NP-hardness of meta-complexity2024-05-08Paper
A duality between one-way functions and average-case symmetry of information2024-05-08Paper
https://portal.mardi4nfdi.de/entity/Q61262762024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61263252024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61263262024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61473952024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61878222024-01-15Paper
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)2024-01-02Paper
Average-case hardness of NP from exponential worst-case hardness assumptions2023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60843582023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q60547462023-10-25Paper
https://portal.mardi4nfdi.de/entity/Q61684762023-08-08Paper
Hardness of constant-round communication complexity2023-07-12Paper
Beyond Natural Proofs: Hardness Magnification and Locality2023-04-27Paper
Cryptographic hardness under projections for time-bounded Kolmogorov complexity2023-04-20Paper
https://portal.mardi4nfdi.de/entity/Q58757412023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58757772023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50924702022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50724832022-04-28Paper
Unexpected hardness results for Kolmogorov complexity under uniform reductions2021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51218932020-09-22Paper
On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets2020-07-20Paper
https://portal.mardi4nfdi.de/entity/Q51111372020-05-26Paper
https://portal.mardi4nfdi.de/entity/Q51112692020-05-26Paper
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems2019-12-16Paper
Beyond Natural Proofs: Hardness Magnification and Locality2019-11-19Paper
Virtual machine placement for minimizing connection cost in data center networks2018-05-24Paper
On characterizations of randomized computation using plain Kolmogorov complexity12018-03-16Paper
Identifying an honest EXP NP oracle among many2018-01-24Paper
https://portal.mardi4nfdi.de/entity/Q53687522017-10-10Paper
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity2014-10-14Paper

Research outcomes over time

This page was built for person: Shuichi Hirahara

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1751255&oldid=6467903"
Powered by MediaWiki