Title of article
Almost all monotone Boolean functions are polynomially learnable using membership queries
Author/Authors
Ilya Shmulevich، نويسنده , , Aleksey D. Korshunov، نويسنده , , Jaakko Astola، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2001
Pages
3
From page
211
To page
213
Keywords
learning , monotone Boolean function , Membership query , computational complexity
Journal title
Information Processing Letters
Serial Year
2001
Journal title
Information Processing Letters
Record number
129375
Link To Document