On the size of depth-two threshold circuits for the inner product mod 2 function

DOI10.1007/978-3-030-40608-0_16zbMATH Open1437.68060OpenAlexW3007102582MaRDI QIDQ782579FDOQ782579

Authors: Kazuyuki Amano 

Publication date: 27 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-40608-0_16

Recommendations

• On the computational power of depth-2 circuits with threshold and modulo gates
• Mathematical Foundations of Computer Science 2005
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
• On realizing iterated multiplication by small depth threshold circuits
• Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
• On complexity of linear operators on the class of circuits of depth 2
• On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions

zbMATH Keywords

linear programminglower boundscircuit complexityupper boundsthreshold circuits

Mathematics Subject Classification ID

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

Cited In (5)

• On the computational power of depth-2 circuits with threshold and modulo gates
• On realizing iterated multiplication by small depth threshold circuits
• Mathematical Foundations of Computer Science 2005
• On Blocky Ranks Of Matrices
• Cryptographic hardness under projections for time-bounded Kolmogorov complexity

This page was built for publication: On the size of depth-two threshold circuits for the inner product mod 2 function

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