Vector analysis of threshold functions
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).
scientific article; zbMATH DE number 797315