The forbidden projections of unate functions

Aaron Feigelson, Lisa Hellerstein

    Research output: Contribution to journalArticle

    Abstract

    We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph minors. Unate functions have been studied in switching theory and in computational learning theory.

    Original languageEnglish (US)
    Pages (from-to)221-236
    Number of pages16
    JournalDiscrete Applied Mathematics
    Volume77
    Issue number3
    StatePublished - Aug 22 1997

    Fingerprint

    Switching theory
    Boolean functions
    Computational Learning Theory
    Forbidden Minor
    Projection
    Graph Minors
    Boolean Functions

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Applied Mathematics
    • Discrete Mathematics and Combinatorics
    • Theoretical Computer Science

    Cite this

    Feigelson, A., & Hellerstein, L. (1997). The forbidden projections of unate functions. Discrete Applied Mathematics, 77(3), 221-236.

    The forbidden projections of unate functions. / Feigelson, Aaron; Hellerstein, Lisa.

    In: Discrete Applied Mathematics, Vol. 77, No. 3, 22.08.1997, p. 221-236.

    Research output: Contribution to journalArticle

    Feigelson, A & Hellerstein, L 1997, 'The forbidden projections of unate functions', Discrete Applied Mathematics, vol. 77, no. 3, pp. 221-236.
    Feigelson A, Hellerstein L. The forbidden projections of unate functions. Discrete Applied Mathematics. 1997 Aug 22;77(3):221-236.
    Feigelson, Aaron ; Hellerstein, Lisa. / The forbidden projections of unate functions. In: Discrete Applied Mathematics. 1997 ; Vol. 77, No. 3. pp. 221-236.
    @article{224029d92d7e4108b34f38592466b07f,
    title = "The forbidden projections of unate functions",
    abstract = "We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph minors. Unate functions have been studied in switching theory and in computational learning theory.",
    author = "Aaron Feigelson and Lisa Hellerstein",
    year = "1997",
    month = "8",
    day = "22",
    language = "English (US)",
    volume = "77",
    pages = "221--236",
    journal = "Discrete Applied Mathematics",
    issn = "0166-218X",
    publisher = "Elsevier",
    number = "3",

    }

    TY - JOUR

    T1 - The forbidden projections of unate functions

    AU - Feigelson, Aaron

    AU - Hellerstein, Lisa

    PY - 1997/8/22

    Y1 - 1997/8/22

    N2 - We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph minors. Unate functions have been studied in switching theory and in computational learning theory.

    AB - We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph minors. Unate functions have been studied in switching theory and in computational learning theory.

    UR - http://www.scopus.com/inward/record.url?scp=16344385002&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=16344385002&partnerID=8YFLogxK

    M3 - Article

    VL - 77

    SP - 221

    EP - 236

    JO - Discrete Applied Mathematics

    JF - Discrete Applied Mathematics

    SN - 0166-218X

    IS - 3

    ER -