期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2016
卷号：2016
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We establish unconditionally that for every integer k 1 there is a language L P such that it is consistent with Cook's theory PV that L S IZ E ( n k ) . Our argument is non-constructive and does not provide an explicit description of this language
