Depth-efficient threshold circuits for multiplication and symmetric function computation

DOI10.1007/3-540-61332-3_156MaRDI QIDQ6184667zbMATH OpenOpenAlexFDO

Authors Chi-Hsiang Yeh, Emmanouel Varvarigos

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61332-3_156

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• Some notes on threshold circuits, and multiplication in depth 4
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• The complexity of computing symmetric functions using threshold circuits
• Threshold circuits of small majority-depth
• scientific article; zbMATH DE number 773998

Cites work

• Depth-size tradeoffs for neural computation
• Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
• Harmonic Analysis of Polynomial Threshold Functions
• scientific article; zbMATH DE number 3358351 (Why is no real title available?)
• scientific article; zbMATH DE number 3420627 (Why is no real title available?)
• Majority Gate Networks
• Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic
• On the power of small-depth threshold circuits
• On Threshold Circuits and Polynomial Computation
• The complexity of computing symmetric functions using threshold circuits

This page was built for publication: Depth-efficient threshold circuits for multiplication and symmetric function computation

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