Computer Science – Computational Complexity
Scientific paper
2004-12-11
Computer Science
Computational Complexity
Presented in DMCS 2004 (Turku, FINLAND)
Scientific paper
We prove fixed points results for sandpiles starting with arbitrary initial
conditions. We give an effective algorithm for computing such fixed points, and
we refine it in the particular case of SPM.
Formenti Enrico
Masson Benoit
No associations
LandOfFree
On computing fixed points for generalized sandpiles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On computing fixed points for generalized sandpiles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On computing fixed points for generalized sandpiles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-263537