Pages that link to "Item:Q2405292"
From MaRDI portal
The following pages link to Inapproximability of the standard pebble game and hard to pebble graphs (Q2405292):
Displaying 6 items.
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- The red-blue pebble game on trees and DAGs with large input (Q2097342) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- (Q5753770) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)