The following pages link to (Q3508753):
Displaying 8 items.
- On the complexity of sandpile critical avalanches (Q549714) (← links)
- Minimal sandpiles on hexagonal lattice (Q1285168) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three (Q4555049) (← links)
- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles (Q5501609) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- How far is it to the next recurrent configuration? An NP-complete problem in the sandpile model (Q6483533) (← links)