Threshold Logic Asymptotes

DOI10.1109/T-C.1970.222921MaRDI QIDQ5590071zbMATH OpenFDO

Authors Robert O. Winder

Publication date 1970

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1970.222921

zbMATH Keywords

maximum number of threshold gates

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11)

Recommendations

• Publication:3469044
• Bounds on Threshold Gate Realizability
• scientific article; zbMATH DE number 850396
• On the number of threshold functions
• scientific article; zbMATH DE number 3869232

Cited in

(8)

• Complete simple games
• Geometry of cut-complexes and threshold logic
• Simple games and magic squares
• On Dedekind's problem for complete simple games
• scientific article; zbMATH DE number 3869232 (Why is no real title available?)
• The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic
• Capacity of multilevel threshold devices
• Weighted and roughly weighted simple games

This page was built for publication: Threshold Logic Asymptotes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5590071)