Vector analysis of threshold functions (Q1898474): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Vwani P. Roychowdhury / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Nicolae Tandareanu / rank
 
Normal rank

Revision as of 09:29, 22 February 2024

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