Vector analysis of threshold functions (Q1898474)

From MaRDI portal
Revision as of 01:16, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Vector analysis of threshold functions
scientific article

    Statements

    Vector analysis of threshold functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 1995
    0 references
    The authors study the realizability of Boolean functions using threshold gates. Using several tools from linear algebra they obtain various results concerning this subject (a lower bound for the number of input functions required by a threshold gate implementing a given function, the error incurred when a Boolean function is approximated, results on circuit complexity etc).
    0 references
    realizability of Boolean functions
    0 references
    threshold gates
    0 references

    Identifiers