![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Fletcher D.
Publisher: Springer Publishing Company
ISSN: 0179-5376
Source: Discrete & Computational Geometry, Vol.46, Iss.2, 2011-09, pp. : 394-403
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity of admissible rules
By Jeřábek Emil
Archive for Mathematical Logic, Vol. 46, Iss. 2, 2007-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On Systems of Complexity One in the Primes
Proceedings of the Edinburgh Mathematical Society, Vol. 60, Iss. 1, 2016-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Computational Complexity of One-Dimensional Sandpiles
Theory of Computing Systems, Vol. 41, Iss. 1, 2007-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Journal of Symbolic Logic, Vol. 73, Iss. 2, 2008-06 ,pp. :