COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi)

## Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi)Add to your list(s) Download to your calendar using vCal - Lauria, M (Academy of Sciences of the Czech Republic)
- Thursday 29 March 2012, 10:00-10:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Semantics and Syntax: A Legacy of Alan Turing During the last decade, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of intrinsic interest, space is also an important issue in SAT solving, and so research has mostly focused on weak systems that are used by SAT solvers. There has been a relatively long sequence of papers on space in resolution and resolution-based proof systems, and it is probably fair to say that resolution is reasonably well understood from this point of view. For other natural candidates to study, however, such as polynomial calculus or cutting planes, very little has been known. We are not aware of any nontrivial space lower bounds for cutting planes, and for polynomial calculus the only lower bound has been for CNF formulas of unbounded width in [Alekhnovich et al.’02], where the space lower bound is smaller than the initial width of the clauses in the formulas. Thus, in particular, it has been consistent with current knowledge that polynomial calculus could be able to refute any k-CNF formula in constant space. In this paper, we prove several new results on space in polynomial calculus (PC), and in the extended proof system polynomial calculus resolution (PCR) studied in [Alekhnovich et al.’02]:
This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsCambridge Area Sequencing Informatics Meeting VI (2014) History and the Law engineering structure seminar## Other talksThe role of the oculomotor system in visual attention and visual short-term memory Mass Spectrometry Enhancing the Brain and Wellbeing in Health and Disease Architecture and the English economy, 1200-1500: a new history of the parish church over the longue durĂ©e Exploring the mechanisms of haematopoietic lineage progression at the single-cell level Computing knot Floer homology ***PLEASE NOTE THIS SEMINAR IS CANCELLED*** Networks, resilience and complexity A polyfold lab report Cyclic Peptides: Building Blocks for Supramolecular Designs Acceleration of tropical cyclogenesis by self-aggregation feedbacks |