ECCC-Report TR19-097https://eccc.weizmann.ac.il/report/2019/097Comments and Revisions published for TR19-097en-usSun, 28 Jul 2019 11:17:00 +0300
Comment 1
| Readable Abstract |
Florian Wörz
https://eccc.weizmann.ac.il/report/2019/097#comment1In this comment, we provide a readable version of the abstract, replacing the question marks with $\pi$. The abstract should read:
``We show a new connection between the space measure in tree-like resolution and the reversible pebble game in graphs. Using this connection we provide several formula classes for which there is a logarithmic factor separation between the space complexity measure in tree-like and general resolution. We show that these separations are almost optimal by proving upper bounds for tree-like resolution space in terms of general resolution clause and variable space. In particular we show that for any formula $F$, its tree-like resolution is upper bounded by $\mathrm{space}(\pi)\log \big(\mathrm{time}(\pi) \big)$ where $\pi$ is any general resolution refutation of $F$. This holds considering as $\mathrm{space}(\pi)$ the clause space of the refutation as well as considering its variable space. For the concrete case of Tseitin formulas we are able to improve this bound to the optimal bound $\mathrm{space}(\pi) \log n$, where $n$ is the number of vertices of the corresponding graph.''Sun, 28 Jul 2019 11:17:00 +0300https://eccc.weizmann.ac.il/report/2019/097#comment1
Paper TR19-097
| Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space |
Florian Wörz,
Jacobo Toran
https://eccc.weizmann.ac.il/report/2019/097We show a new connection between the space measure in tree-like resolution and the reversible pebble game in graphs. Using this connection we provide several formula classes for which there is a logarithmic factor separation between the space complexity measure in tree-like and general resolution. We show that these separations are almost optimal by proving upper bounds for tree-like resolution space in terms of general resolution clause and variable space. In particular we show that for any formula F, its tree-like resolution is upper bounded by space(?)log time(?) where ? is any general resolution refutation of F. This holds considering as space(?) the clause space of the refutation as well as considering its variable space. For the concrete case of Tseitin formulas we are able to improve this bound to the optimal bound space(?)log(n), where n is the number of vertices of the corresponding graph.Wed, 24 Jul 2019 15:09:27 +0300https://eccc.weizmann.ac.il/report/2019/097