On the complexity of resolution with bounded conjunctions

Theoretical Computer Science(2004)

引用 0|浏览0
暂无评分
摘要
We analyze size and space complexity of Res(k), a family of propositional proof systems introduced by Krajicek in (Fund. Math. 170 (1-3) (2001) 123) which extend Resolution by allowing disjunctions of conjunctions of up to k ≥ 1 literals. We show that the treelike Res(k) proof systems form a strict hierarchy with respect to proof size and also with respect to space. Moreover Resolution, while simulating treelike Res(k), is almost exponentially separated from treelike Res(k). To study space complexity for general Res(k) we introduce the concept of dynamical satisfiability which allows us to prove in a unified way all known space lower bounds for Resolution and to extend them to Res(k).
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要