Pages that link to "Item:Q5098782"

The following pages link to On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions (Q5098782):

Displaying 7 items.

• Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
• On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions (Q1367525) (← links)
• Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
• Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
• Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (Q2890182) (← links)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
• On Computing Multilinear Polynomials Using Multi- <i>r</i> -ic Depth Four Circuits (Q5868876) (← links)