Pages that link to "Item:Q1590079"

The following pages link to Exponential lower bounds for depth three Boolean circuits (Q1590079):

Displaying 18 items.

• A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
• Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
• The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
• Exponential size lower bounds for some depth three circuits (Q1327392) (← links)
• Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
• Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. (Q1573765) (← links)
• Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
• Subset sum ``cubes'' and the complexity of primality testing (Q1885040) (← links)
• Top-down lower bounds for depth-three circuits (Q1904663) (← links)
• \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
• Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
• The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
• Circuits with medium fan-in (Q4601838) (← links)
• Parity helps to compute majority (Q5091774) (← links)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
• (Q5111162) (← links)
• (Q5121893) (← links)
• Depth-3 circuits for inner product (Q6614883) (← links)