scientific article; zbMATH DE number 773998

MaRDI QIDQ4839052zbMATH OpenFDO

Authors Thomas Hofmeister

Publication date 10 April 1996

zbMATH Keywords

threshold circuits

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Circuits, networks (94C99)

Recommendations

• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• Threshold circuits of small majority-depth
• Some notes on threshold circuits, and multiplication in depth 4
• The complexity of computing symmetric functions using threshold circuits
• An arithmetic model of computation equivalent to threshold circuits

Cited in

(8)

• Efficient monotone circuits for threshold functions
• On the computational power of depth-2 circuits with threshold and modulo gates
• Efficient threshold circuits for power series
• Succinct functional commitment for a large class of arithmetic circuits
• Threshold Circuits for Iterated Matrix Product and Powering
• On realizing iterated multiplication by small depth threshold circuits
• Depth-efficient threshold circuits for multiplication and symmetric function computation
• Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates

This page was built for publication:

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