On realizing iterated multiplication by small depth threshold circuits

DOI10.1007/3-540-59042-0_64MaRDI QIDQ4596612zbMATH OpenOpenAlexFDO

Authors Matthias Krause

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_64

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• scientific article; zbMATH DE number 773998
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• On the size of depth-two threshold circuits for the inner product mod 2 function
• scientific article; zbMATH DE number 512860
• On the computational power of depth 2 circuits with threshold and modulo gates
• On the computational power of depth-2 circuits with threshold and modulo gates
• On the power of small-depth threshold circuits
• Threshold circuits of small majority-depth
• Mathematical Foundations of Computer Science 2005

Cited in

(5)

• On iterated integer product
• Iterated multiplication in VTC^0
• scientific article; zbMATH DE number 512860 (Why is no real title available?)
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• On the size of depth-two threshold circuits for the inner product mod 2 function

This page was built for publication: On realizing iterated multiplication by small depth threshold circuits

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