文章基本信息

标题：An Exponential Separation between Regular and General Resolution
本地全文：下载
作者：Michael Alekhnovich ; Jan Johannsen ; Toniann Pitassi 等
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems was quasi-polynomial.
关键词：lower bound , propositional proof complexity , regular resolution , Resolution