Decision tree approximations of Boolean functions-Reference-Cited by-同舟云学术

Decision tree approximations of Boolean functions

Published:2002-01 Issue:1-2 Volume:270 Page:609-623
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Mehta Dinesh,Raghavan Vijay

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time;Blum;Inform. Process. Lett.,1980

2. Occam's razor;Blumer;Inform. Process. Lett.,1987

3. Exact learning Boolean functions via the monotone theory;Bshouty;Inform. and Comput.,1995

4. N.H. Bshouty, Y. Mansour, Simple learning algorithms for decision trees and multivariate polynomials, Proc. Foundations of Computer Science (FOCS), 1995, pp. 304–311.

5. Partial Occam's razor and its applications;Domingo;Inform. Process. Lett.,1997

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Properly learning decision trees with queries is NP-hard;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Symbolic and Hybrid Models of Cognition;The Cambridge Handbook of Computational Cognitive Sciences;2023-05-11

3. Cognitive Modeling Paradigms;The Cambridge Handbook of Computational Cognitive Sciences;2023-05-11

4. Artificial intelligence and machine learning overview in pathology & laboratory medicine: A general review of data preprocessing and basic supervised concepts;Seminars in Diagnostic Pathology;2023-03

5. Properly Learning Decision Trees in almost Polynomial Time;Journal of the ACM;2022-11-24