✦ LIBER ✦

Learning Monotone Decision Trees in Polynomial Time

✍ Scribed by O'Donnell, Ryan; Servedio, Rocco A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Piecewise Monotone Interpolation in Poly

✍ Raymon, L. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 444 KB

Simple Learning Algorithms for Decision

✍ Bshouty, Nader H.; Mansour, Yishay 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 229 KB

Delay time sensitivity in nonlinear mono

✍ Jain, N.K.; Prasad, V.C.; Bhattacharyya, A.B. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 505 KB

Polynomial-Time Algorithms for Minimum-T

✍ Cohen; Fraigniaud; Mitjana 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 250 KB

Near-Optimal Reinforcement Learning in P

✍ Michael Kearns; Satinder Singh 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 143 KB

Evolutionary Trees Can be Learned in Pol

✍ Cryan, Mary; Goldberg, Leslie Ann; Goldberg, Paul W. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 274 KB