( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Learnability of Boolean Formulae

, , , и . STOC, стр. 285-295. ACM, (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Eberhard Pitt

Axel Pitt

Pitt Schwendler

Pitt Niehusmann

Pitt Breitfeld

 

Другие публикации лиц с тем же именем

On the Necessity of Occam Algorithms, и . STOC, стр. 54-63. ACM, (1990)On Exploiting Knowledge and Concept Use in Learning Theory.. ALT, том 1316 из Lecture Notes in Computer Science, стр. 62-84. Springer, (1997)Sublinear time approximate clustering., , и . SODA, стр. 439-447. ACM/SIAM, (2001)Criteria for Polynomial-Time (Conceptual) Clustering., и . Mach. Learn., 2 (4): 371-396 (1987)Exact Learning of Read-Twice DNF Formulas (Extended Abstract), и . FOCS, стр. 170-179. IEEE Computer Society, (1991)Inductive Inference, DFAs, and Computational Complexity.. AII, том 397 из Lecture Notes in Computer Science, стр. 18-44. Springer, (1989)Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries., , и . Mach. Learn., 37 (1): 89-110 (1999)Maximal boasting., и . KDD, стр. 580-585. ACM, (2005)Probability and Plurality for Aggregations of Learning Machines, и . Inf. Comput., 77 (1): 77-92 (апреля 1988)Designing and Piloting a High School CS+X Topics Course., , , , и . SIGCSE (1), стр. 562-568. ACM, (2024)