Pages that link to "Item:Q3225912"

The following pages link to Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912):

Displaying 15 items.

• On shifting networks (Q685361) (← links)
• Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
• An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
• Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
• Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving (Q1104301) (← links)
• Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
• On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions (Q1367525) (← links)
• Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
• The function-inversion problem: barriers and opportunities (Q2175919) (← links)
• \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
• A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
• (Q3115241) (← links)
• Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth (Q5121914) (← links)
• Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995) (← links)
• Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767) (← links)