"Restricted optimal pebbling is NP-hard."

László F. Papp (2023)

Details and statistics

DOI: 10.48550/ARXIV.2301.09867

access: open

type: Informal or Other Publication

metadata version: 2023-01-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics