May 30, 2023 · Both standard and reversible pebbling space are PSPACE-hard to approximate to within any additive constant.

Standard and reversible pebbling are PSPACE-hard to approximate within any additive constant. Marc Vinyals (KTH). Hardness and Separation for Pebble Games. 7 / ...

May 30, 2023 · Our hardness of approximation result for the standard pebble game was improved by Demaine and Liu [DL17], who proved that it is PSPACE-hard to ...

May 30, 2023 · To the best of our knowledge, these are the first hardness of approximation results for pebble games in an unrestricted setting (even for ...

It is established that both standard and reversible pebbling space are PSPace-hard to approximate to within any additive constant.

Both standard and reversible pebbling space are PSPACE-hard to approximate to within any additive constant.

Dec 11, 2015 · To the best of our knowledge, these are the first hardness of approximation results for pebble games in an unrestricted setting (even for ...

Aug 5, 2024 · Siu Man Chan, Massimo Lauria , Jakob Nordström , Marc Vinyals : Hardness of Approximation in PSPACE and Separation Results for Pebble Games.

Hardness of Approximation in PSPACE and Separation Results for Pebble Games ... 2015 IEEE 56th Annual Symposium on Foundations of… 2015. TLDR.

Jul 9, 2020 · Red-blue pebble games model the computation cost of a two-level memory hierarchy. We present various hardness results in different red-blue pebbling variants.