On the query complexity of learning
暂无分享,去创建一个
[1] Dana Angluin. Negative results for equivalence queries , 1990, Mach. Learn..
[2] Vasek Chvátal. Probabilistic methods in graph theory , 1984, Ann. Oper. Res..
[3] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[4] Ravi B. Boppana,et al. Amplification of probabilistic boolean formulas , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[5] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.
[6] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[7] Michael Kearns,et al. Computational complexity of machine learning , 1990, ACM distinguished dissertations.
[8] D. Angluin. Queries and Concept Learning , 1988 .