Author: Fouks J.-D.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.223, Iss.1, 1999-07, pp. : 121-142
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
A theory of even functionals and their algorithmic applications
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
Entropy and algorithmic complexity in quantum information theory
Natural Computing, Vol. 6, Iss. 2, 2007-06 ,pp. :
An algorithmic theory of learning: Robust concepts and random projection
By Arriaga Rosa
Machine Learning, Vol. 63, Iss. 2, 2006-05 ,pp. :
Prediction algorithms and confidence measures based on algorithmic randomness theory
Theoretical Computer Science, Vol. 287, Iss. 1, 2002-09 ,pp. :
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :