平原 秀一

Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity 

61th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2020) 2020年  査読有り

Unexpected hardness results for Kolmogorov complexity under uniform reductions. 

52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020) 1038 - 1051 2020年  査読有り

Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. 

35th Computational Complexity Conference (CCC 2020) 20:1 - 20:47 2020年  査読有り

NP-hardness of minimum circuit size problem for OR-AND-MOD circuits 

Leibniz International Proceedings in Informatics, LIPIcs 102 51 - 531 2018年6月1日  査読有り

Non-Black-Box Worst-Case to Average-Case Reductions within NP. 

59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018 247 - 258 2018年  査読有り