Author: Etessami K.
Publisher: Springer Publishing Company
ISSN: 0020-7276
Source: International Journal of Game Theory, Vol.37, Iss.1, 2008-04, pp. : 93-113
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The Computational Complexity of Weak Saddles
By Brandt Felix
Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. :
On generalized computational complexity
The Journal of Symbolic Logic, Vol. 42, Iss. 1, 1977-03 ,pp. :
Classifying the computational complexity of problems
The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. :
The Computational Complexity of One-Dimensional Sandpiles
Theory of Computing Systems, Vol. 41, Iss. 1, 2007-07 ,pp. :
On computational complexity in weakly admissible structures
The Journal of Symbolic Logic, Vol. 45, Iss. 2, 1980-06 ,pp. :