Some notes on threshold circuits, and multiplication in depth 4

DOI10.1016/0020-0190(91)90183-IzbMath0735.68038OpenAlexW2088543905MaRDI QIDQ1182104

Susanne Köhling, Walter Hohberg, Thomas Hofmeister

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90183-i

zbMATH Keywords

parallel algorithmsmultiplicationthreshold circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (6)

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models ⋮ On small depth threshold circuits ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Upper and lower bounds for some depth-3 circuit classes ⋮ On the computational power of depth-2 circuits with threshold and modulo gates ⋮ Threshold circuits of small majority-depth

Cites Work

• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Parallel computation with threshold functions
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• Parity, circuits, and the polynomial-time hierarchy
• Constant Depth Reducibility
• Unnamed Item
• Unnamed Item

This page was built for publication: Some notes on threshold circuits, and multiplication in depth 4