Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Hirahara, Shuichi
78  Ergebnisse:
Personensuche X
?
1

Probabilistically Checkable Reconfiguration Proofs and Inap..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi ; Ohsaka, Naoto - p. 1435-1445 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Planted Clique Conjectures Are Equivalent:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi ; Shimizu, Nobutaka - p. 358-366 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Symmetric Exponential Time Requires Near-Maximum Circuit Si..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Chen, Lijie ; Hirahara, Shuichi ; Ren, Hanlin - p. 1990-1999 , 2024
Link: https://dl.acm.org/doi/1..
 
?
4

Beating Brute Force for Compression Problems:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi ; Ilango, Rahul ; Williams, R. Ryan - p. 659-670 , 2024
Link: https://dl.acm.org/doi/1..
 
?
5

One-Way Functions and Zero Knowledge:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi ; Nanashima, Mikito - p. 1731-1738 , 2024
Link: https://dl.acm.org/doi/1..
 
?
6

Cryptographic hardness under projections for time-bounded K..:

Allender, Eric ; Gouwar, John ; Hirahara, Shuichi.
Theoretical Computer Science.  940 (2023)  - p. 206-224 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Capturing One-Way Functions via NP-Hardness of Meta-Complex..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi - p. 1027-1038 , 2023
Link: https://dl.acm.org/doi/1..
 
?
8

A Duality between One-Way Functions and Average-Case Symmet..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi ; Ilango, Rahul ; Lu, Zhenjian.. - p. 1039-1050 , 2023
Link: https://dl.acm.org/doi/1..
 
?
9

Non-Black-Box Worst-Case to Average-Case Reductions Within ..:

Hirahara, Shuichi
SIAM Journal on Computing.  52 (2023)  6 - p. FOCS18-349-FOCS18-382 , 2023
Link: https://doi.org/10.1137/..
 
?
10

Learning in Pessiland via Inductive Inference:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Hirahara, Shuichi ; Nanashima, Mikito - p. 447-457 , 2023
Link: https://doi.org/10.1109/..
 
?
11

Hardness Self-Amplification: Simplified, Optimized, and Uni..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Hirahara, Shuichi ; Shimizu, Nobutaka - p. 70-83 , 2023
Link: https://dl.acm.org/doi/1..
 
?
12

NP-Hardness of Learning Programs and Partial MCSP:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Hirahara, Shuichi - p. 968-979 , 2022
Link: https://doi.org/10.1109/..
 
?
13

Finding errorless pessiland in error-prone heuristica:

, In: Proceedings of the 37th Computational Complexity Conference,
Hirahara, Shuichi ; Nanashima, Mikito - p. 1-28 , 2022
Link: https://dl.acm.org/doi/1..
 
?
14

Beyond Natural Proofs: Hardness Magnification and Locality:

Chen, Lijie ; Hirahara, Shuichi ; Oliveira, Igor Carboni...
Journal of the ACM.  69 (2022)  4 - p. 1-49 , 2022
Link: https://doi.org/10.1145/..
 
?
15

On Worst-Case Learning in Relativized Heuristica:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Hirahara, Shuichi ; Nanashima, Mikito - p. 751-758 , 2022
Link: https://doi.org/10.1109/..
 
1-15