We prove that the Nisan-Wigderson generators based on computationally hard functions and suitable matrices are hard for propositional proof systems that admit feasible interpolation.
科研之友
微信
新浪微博
Facebook
分享链接
