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 · To the best of our knowledge, these are the first hardness of approximation results for pebble games in an unrestricted setting (even for ...

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 ...

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

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

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

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). ... We ...

Hardness of Approximation in PSPACE and Separation Results for Pebble Games ... KTH Royal Institute of Technology Stockholm, Sweden, School of Computer Science ...

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 ...