✦ LIBER ✦

Uniform characterizations of polynomial-query learnabilities

✍ Scribed by Yosuke Hayashi; Satoshi Matsumoto; Ayumi Shinohara; Masayuki Takeda

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On uniform learnability of language fami

✍ Shyam Kapur; Gianfranco Bilardi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 341 KB

Polynomial time learnability of simple d

✍ Ishizaka, Hiroki 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 753 KB

Polynomial Time Learnability of Simple D

✍ Ishizaka, Hiroki 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 794 KB

Uniform characterizations of non-uniform

✍ José L. Balcázar; Josep Díaz; Joaquim Gabarró 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 805 KB

Some Characterizations of Polynomial-Gau

✍ A. Plucińska 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 126 KB

Construction and characterization of non

✍ Carolina Vittoria Beccari; Giulio Casciola; Lucia Romani 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 521 KB