Publisher： Cambridge University Press
E-ISSN： 1943-5886|72|4|1197-1203
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.72, Iss.4, 2007-12, pp. : 1197-1203
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
Access to resources
Recommend
Computability, Complexity and Randomness
By Downey Rod
Theory of Computing Systems, Vol. 52, Iss. 1, 2013-01 ,pp. :
Complexity of admissible rules
By Jeřábek Emil
Archive for Mathematical Logic, Vol. 46, Iss. 2, 2007-02 ,pp. :
Complexity penalized support estimation
By Klemela J.
Journal of Multivariate Analysis, Vol. 88, Iss. 2, 2004-02 ,pp. :
Arrangement, a Measure of Nonrandom Complexity
By Sabelli H.
Systems Analysis Modelling Simulation, Vol. 42, Iss. 3, 2002-01 ,pp. :