Almost all monotone Boolean functions are polynomially learnable usig membership queries

I. Schmulevich, A.D. Koshunov, J. Astola

    Research output: Contribution to journalArticleScientificpeer-review

    Translated title of the contributionAlmost all monotone Boolean functions are polynomially learnable usig membership queries
    Original languageEnglish
    Pages (from-to)211-213
    JournalInformation Processing Letters
    Publication statusPublished - 2001
    Publication typeA1 Journal article-refereed

    Publication forum classification

    • No publication forum level

    Cite this