@inproceedings{1994RelationCT, title={Relation Cpu Times Comb Match}, author={}, year={1994} }

- Published 1994

Average cpu times (in seconds) for two, three, and four positive and ten negative examples, plus the average number of subterm combinations (Comb) and number of those whose lists of generating terms match (Match) for four positive and ten negative examples Relation Cpu Times Comb Match 2 3 4 ing recursive relations between f i and f i+k is similar to how… CONTINUE READING

### Presentations referencing similar topics