𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Computational Complexity of Sandpiles

✍ Scribed by Cristopher Moore; Martin Nilsson

Book ID
111534865
Publisher
Springer
Year
1999
Tongue
English
Weight
235 KB
Volume
96
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Computational Complexity of Immanant
The Computational Complexity of Immanants
✍ BΓΌrgisser, Peter πŸ“‚ Article πŸ“… 2000 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 231 KB
Degrees of computational complexity
Degrees of computational complexity
✍ H.B. Enderton πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 316 KB

We consider a measure ~b of computational complexity. The measure 9 determines a binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f off such that for nearly all x, the difficulty off at x (as measured by ~) is no more than the

The Computational Complexity of Weak Sad
The Computational Complexity of Weak Saddles
✍ Felix Brandt; Markus Brill; Felix Fischer; Jan Hoffmann πŸ“‚ Article πŸ“… 2010 πŸ› Springer 🌐 English βš– 760 KB