About complexity of implementing threshold functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3644977 (Why is no real title available?)
- scientific article; zbMATH DE number 850396 (Why is no real title available?)
- scientific article; zbMATH DE number 3405843 (Why is no real title available?)
- Dynamic Errors in Electronic Analog Computers
- Monotone Boolean functions
- The complexity of monotone boolean functions
- The synthesis of symmetric-function logic systems by a combined method.
Cited in
(7)- Higher-Order Threshold Implementations
- On the constructive characterization of threshold functions
- On the complexity of monotone circuits for threshold symmetric Boolean functions
- scientific article; zbMATH DE number 3685415 (Why is no real title available?)
- On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements
- Improving first-order threshold implementations of \textsf{SKINNY}
- Computational aspects of ideal \((t, n)\)-threshold scheme of Chen, Laing, and Martin
This page was built for publication: About complexity of implementing threshold functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682325)