On the learnability of Boolean formulae
暂无分享,去创建一个
Leslie G. Valiant | Leonard Pitt | Ming Li | Michael Kearns | M. Kearns | Ming Li | L. Pitt | L. Valiant
[1] D. Matula,et al. GRAPH COLORING ALGORITHMS , 1972 .
[2] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[5] Avi Wigderson,et al. A new approximate graph coloring algorithm , 1982, STOC '82.
[6] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[7] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.
[8] David Haussler. Quantifying the Inductive Bias in Concept Learning (Extended Abstract) , 1986, AAAI.
[9] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[10] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.