期刊名称:Electronic Colloquium on Computational Complexity
印刷版ISSN:1433-8092
出版年度:2010
卷号:2010
出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要: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.