Pages that link to "Item:Q1573765"

The following pages link to Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. (Q1573765):

Displayed 19 items.

• Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) ‎ (← links)
• Arithmetic circuits: the chasm at depth four gets wider (Q442109) ‎ (← links)
• A spectral theory for tensors (Q661140) ‎ (← links)
• Algebraic proof systems over formulas. (Q1401356) ‎ (← links)
• Ulrich complexity (Q1679674) ‎ (← links)
• Circuit and decision tree complexity of some number theoretic problems (Q1854439) ‎ (← links)
• Affine projections of symmetric polynomials. (Q1872730) ‎ (← links)
• Limitations of sums of bounded read formulas and ABPs (Q2117084) ‎ (← links)
• Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) ‎ (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) ‎ (← links)
• Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) ‎ (← links)
• A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) ‎ (← links)
• Uniform derandomization from pathetic lower bounds (Q2941601) ‎ (← links)
• On the Expressive Power of Read-Once Determinants (Q2947872) ‎ (← links)
• The Computational Power of Depth Five Arithmetic Circuits (Q4629389) ‎ (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) ‎ (← links)
• (Q5092488) ‎ (← links)
• (Q5121899) ‎ (← links)
• Approaching the Chasm at Depth Four (Q5501936) ‎ (← links)