Pages that link to "Item:Q3906416"
From MaRDI portal
The following pages link to The Pebbling Problem is Complete in Polynomial Space (Q3906416):
Displayed 19 items.
- DAG reversal is NP-complete (Q1044024) (← links)
- Single-suit two-person card play (Q1093570) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Pebble games for studying storage sharing (Q1162159) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- Reversible Pebble Game on Trees (Q3196374) (← links)
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)