Nobutaka Shimizu

理論計算機科学における 数学の応用: 擬似ランダムネス

Planted Clique Conjectures are Equivalent

Hardness Self-Amplification: Simplified, Optimized, and Unified

Hardness Self-Amplification from Feasible Hard-Core Sets

Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models

Quasi-majority Functional Voting on Expander Graphs

How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?

Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH