Pages that link to "Item:Q845823"

The following pages link to The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823):

Displaying 8 items.

• Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
• New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
• Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) (Q1322486) (← links)
• On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions (Q1367525) (← links)
• Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
• (Q3735704) (← links)
• Circuit Bottom Fan-in and Computational Power (Q4388876) (← links)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)