On the necessity of Occam algorithms-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the necessity of Occam algorithms

Published:1992-06 Issue:1 Volume:100 Page:157-184
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Board Raymond,Pitt Leonard

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. Polynomial learnability of semilinear sets;Abe,1989

2. Negative results for equivalence queries;Angluin;Machine Learning,1990

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

4. Learnability and the Vapnik-Chervonenkis dimension;Blumer;J. ACM,1989

5. A general lower bound on the number of examples needed for learning;Ehrenfeucht;Inform. and Comput.,1989

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

1. Short Boolean Formulas as Explanations in Practice;Logics in Artificial Intelligence;2023

2. NP-Hardness of Learning Programs and Partial MCSP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. On the Quantum versus Classical Learnability of Discrete Distributions;Quantum;2021-03-23

4. Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs;2014 IEEE 55th Annual Symposium on Foundations of Computer Science;2014-10

5. Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms;Computational Mathematics and Mathematical Physics;2013-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP