Depth-efficient threshold circuits for multiplication and symmetric function computation

DOI10.1007/3-540-61332-3_156zbMath1529.68102OpenAlexW1556207645MaRDI QIDQ6184667

Chi-Hsiang Yeh, Emmanouel A. 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)

Cites Work

• Unnamed Item
• Unnamed Item
• On the power of small-depth threshold circuits
• The complexity of computing symmetric functions using threshold circuits
• Harmonic Analysis of Polynomial Threshold Functions
• On Threshold Circuits and Polynomial Computation
• Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
• Depth-size tradeoffs for neural computation
• Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic
• Majority Gate Networks

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