"On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling."

Jeremiah Blocki, Samson Zhou (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-662-58387-6_18

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fc/BlockiZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fc/BlockiZ18
Jeremiah Blocki, Samson Zhou:
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. Financial Cryptography 2018: 329-346

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.