Bounds on Threshold Gate Realizability

DOI10.1109/PGEC.1963.263657zbMATH Open0203.15702MaRDI QIDQ5601779FDOQ5601779

Authors: Robert O. Winder 

Publication date: 1963

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

Recommendations

• Lower bounds for threshold circuits of bounded energy
• Calculable lower bounds on the efficiency of universal sets of quantum gates
• Bootstrapping results for threshold circuits ``just beyond known lower bounds
• Fundamentals of Computation Theory
• Quantum matchgate computations and linear threshold gates
• Exact quantum query complexity of EXACT and THRESHOLD
• scientific article; zbMATH DE number 524134
• On the Size of Weights for Threshold Gates
• A lower bound method for quantum circuits
• Classical simulability, entanglement breaking, and quantum computation thresholds

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cited In (6)

• Characteristic measures of switching functions
• A geometrical method in combinatorial complexity
• Threshold Logic Asymptotes
• Breaker Page
• Realization of Logical Functions by a Network of Threshold Components with Specified Sensitivity
• Un programma per la sintesi di reti 'THRESHOLD-OR' basato sul metodo di Fischler

This page was built for publication: Bounds on Threshold Gate Realizability

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