期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We prove exponential separations between the sizes of particular refutations in negative, respectively linear, resolution and general resolution. Only a superpolynomial separation between negative and general resolution was previously known. Our examples show that there is no strong relationship between the size and width of refutations in negative and linear resolution.
