New composition theorem for learning algorithms

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 583-589

  Bshouty, Nader H ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS; THEOREM PROVING;

COMPOSITION THEOREM;

LEARNING ALGORITHMS;

EID: 0031636498     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)