Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Ref.pdfVIP

下载本文档

4
0
约4.32万字
约 17页
2017-04-13 发布于江苏
举报
版权申诉

Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Ref.pdf

1、本文档共17页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Ref

a r X i v : c s / 0 3 0 8 0 1 2 v 1 [ c s .C C ] 5 A u g 2 0 0 3 Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations Russell Impagliazzo? and Nathan Segerlind?? Department of Computer Science University of California, San Diego La Jolla, CA 92093 {russell,nsegerli}@cs.ucsd.edu Abstract. We show that constant-depth Frege systems with counting axioms modulo m polynomially simulate Nullstellensatz refutations mod- ulo m. Central to this is a new definition of reducibility from formulas to systems of polynomials with the property that, for most previously studied translations of formulas to systems of polynomials, a formula reduces to its translation. When combined with a previous result of the authors, this establishes the first size separation between Nullstellensatz and polynomial calculus refutations. We also obtain new, small refuta- tions for certain CNFs by constant-depth Frege systems with counting axioms. 1 Introduction This paper studies proof sizes in propositional systems that utilize modular counting in limited ways. The complexity of propositional proofs has received much attention in recent years because of its connections to computational and circuit complexity [17,20,25,7]. In particular, NP equals coNP if and only if there exists a propositional proof system that proves every tautology in size polynomial in the size of the tautology [17]. But before we can prove lower bounds for all proof systems, it seems necessary that we be able to prove lower bounds for specific proof systems. There was much initial success showing lower bounds for constant-depth proof systems [1,22,24]. While these proof systems can simulate many powerful theorem proving techniques, such as resolution, they cannot perform reasoning that involves modular counting. For this reason, there has been much interest in recent years regarding proof systems that incorporate modular counting in different ways. Three such systems are: co