Nearly tight bounds on the learnability of evolution

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 524-533

  Ambainis, Andris ^a   Desper, Richard ^a   Farach, Martin ^a   Kannan, Sampath ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; RANDOM PROCESSES; TREES (MATHEMATICS);

CAVENDER-FARRIS (CF) TREES;

LEARNING SYSTEMS;

EID: 0031352178     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)