Name
Abstract | ||
|---|---|---|
We consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt '70] and the reversible version of this game in [Bennett '89], and study the question of how hard it is to decide exactly or approximately the number of pebbles needed for a given DAG in these games. We prove that the problem of deciding whether s pebbles suffice to reversibly pebble a DAG G is PSPACE-complete, as was previously shown for the standard pebble game in [Gilbert, Lengauer and Tarjan '80]. Via two different graph product constructions we then strengthen these results to establish that both standard and reversible pebbling space are PSPACE-hard to approximate to within any additive constant. To the best of our knowledge, these are the first hardness of approximation results for pebble games in an unrestricted setting (even for polynomial time). Also, since [Chan '13] proved that reversible pebbling is equivalent to the games in [Dymond and Tompa '85] and [Raz and McKenzie '99], our results apply to the Dymond -- Tompa and Raz -- McKenzie games as well, and from the same paper it follows that resolution depth is PSPACE-hard to determine up to any additive constant. We also obtain a multiplicative logarithmic separation between reversible and standard pebbling space. This improves on the additive logarithmic separation previously known and could plausibly be tight, although we are not able to prove this. We leave as an interesting open problem whether our additive hardness of approximation result could be strengthened to a multiplicative bound if the computational resources are decreased from polynomial space to the more common setting of polynomial time. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/FOCS.2015.36 | IEEE Symposium on Foundations of Computer Science |
Keywords | Field | DocType |
pebbling,reversible pebbling,Dymond-Tompa game,Raz-McKenzie game,PSPACE-complete,separation,PSPACE-hardness of approximation,resolution depth | Discrete mathematics,Combinatorics,Open problem,Polynomial,Hardness of approximation,PSPACE-complete,PSPACE,Graph product,Time complexity,Mathematics,Bounded function | Conference |
ISSN | Citations | PageRank |
0272-5428 | 6 | 0.50 |
References | Authors | |
26 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siu Man Chan | 1 | 68 | 4.10 |
| Massimo Lauria | 2 | 122 | 14.73 |
| Jakob Nordström | 3 | 177 | 21.76 |
| Marc Vinyals | 4 | 28 | 4.91 |