Pages that link to "Item:Q4825392"
From MaRDI portal
The following pages link to Time and space complexity of reversible pebbling (Q4825392):
Displaying 7 items.
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- On the cost of recomputing: tight bounds on pebbling with faults (Q4632415) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)