On the complexity of deciphering the threshold functions of \(k\)-valued logic (Q1594168)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of deciphering the threshold functions of \(k\)-valued logic
scientific article

    Statements

    On the complexity of deciphering the threshold functions of \(k\)-valued logic (English)
    0 references
    0 references
    0 references
    28 January 2001
    0 references
    threshold functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references