Towards an understanding of polynomial calculus : New separations and lower bounds (extended abstract)
(2013) 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 In Lecture Notes in Computer Science 7965(PART 1). p.437-448- Abstract
During the last decade, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of resolution are fairly well understood, but many open problems remain for the related but stronger polynomial calculus (PC/PCR) proof system. For instance, the space complexity of many standard "benchmark formulas" is still open, as well as the relation of space to size and degree in PC/PCR. We prove that if a formula requires large resolution width, then making XOR substitution yields a formula requiring large PCR space, providing some circumstantial evidence that degree might be a lower bound for space. More importantly, this immediately yields formulas... (More)
During the last decade, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of resolution are fairly well understood, but many open problems remain for the related but stronger polynomial calculus (PC/PCR) proof system. For instance, the space complexity of many standard "benchmark formulas" is still open, as well as the relation of space to size and degree in PC/PCR. We prove that if a formula requires large resolution width, then making XOR substitution yields a formula requiring large PCR space, providing some circumstantial evidence that degree might be a lower bound for space. More importantly, this immediately yields formulas that are very hard for space but very easy for size, exhibiting a size-space separation similar to what is known for resolution. Using related ideas, we show that if a graph has good expansion and in addition its edge set can be partitioned into short cycles, then the Tseitin formula over this graph requires large PCR space. In particular, Tseitin formulas over random 4-regular graphs almost surely require space at least Ω(√n). Our proofs use techniques recently introduced in [Bonacina-Galesi '13]. Our final contribution, however, is to show that these techniques provably cannot yield non-constant space lower bounds for the functional pigeonhole principle, delineating the limitations of this framework and suggesting that we are still far from characterizing PC/PCR space.
(Less)
- author
- Filmus, Yuval ; Lauria, Massimo ; Mikša, Mladen ; Nordström, Jakob LU and Vinyals, Marc
- publishing date
- 2013
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Proceedings - 40th International Colloquium, ICALP 2013, Proceedings
- series title
- Lecture Notes in Computer Science
- volume
- 7965
- issue
- PART 1
- edition
- PART 1
- pages
- 12 pages
- publisher
- Springer
- conference name
- 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
- conference location
- Riga, Latvia
- conference dates
- 2013-07-08 - 2013-07-12
- external identifiers
-
- scopus:84880288724
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 9783642392054
- DOI
- 10.1007/978-3-642-39206-1_37
- language
- English
- LU publication?
- no
- id
- 01e5a064-b88e-4bc8-95e6-1db7cd82e265
- date added to LUP
- 2020-12-18 22:25:34
- date last changed
- 2025-07-25 18:15:48
@inproceedings{01e5a064-b88e-4bc8-95e6-1db7cd82e265,
abstract = {{<p>During the last decade, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of resolution are fairly well understood, but many open problems remain for the related but stronger polynomial calculus (PC/PCR) proof system. For instance, the space complexity of many standard "benchmark formulas" is still open, as well as the relation of space to size and degree in PC/PCR. We prove that if a formula requires large resolution width, then making XOR substitution yields a formula requiring large PCR space, providing some circumstantial evidence that degree might be a lower bound for space. More importantly, this immediately yields formulas that are very hard for space but very easy for size, exhibiting a size-space separation similar to what is known for resolution. Using related ideas, we show that if a graph has good expansion and in addition its edge set can be partitioned into short cycles, then the Tseitin formula over this graph requires large PCR space. In particular, Tseitin formulas over random 4-regular graphs almost surely require space at least Ω(√n). Our proofs use techniques recently introduced in [Bonacina-Galesi '13]. Our final contribution, however, is to show that these techniques provably cannot yield non-constant space lower bounds for the functional pigeonhole principle, delineating the limitations of this framework and suggesting that we are still far from characterizing PC/PCR space.</p>}},
author = {{Filmus, Yuval and Lauria, Massimo and Mikša, Mladen and Nordström, Jakob and Vinyals, Marc}},
booktitle = {{Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Proceedings}},
isbn = {{9783642392054}},
issn = {{1611-3349}},
language = {{eng}},
number = {{PART 1}},
pages = {{437--448}},
publisher = {{Springer}},
series = {{Lecture Notes in Computer Science}},
title = {{Towards an understanding of polynomial calculus : New separations and lower bounds (extended abstract)}},
url = {{http://dx.doi.org/10.1007/978-3-642-39206-1_37}},
doi = {{10.1007/978-3-642-39206-1_37}},
volume = {{7965}},
year = {{2013}},
}