Pages that link to "Item:Q1273878"

The following pages link to Threshold circuits of small majority-depth (Q1273878):

Displaying 11 items.

• Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
• Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
• Efficient threshold circuits for power series (Q1854292) (← links)
• Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
• The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
• The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
• Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
• Parity helps to compute majority (Q5091774) (← links)
• Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)