Pages that link to "Item:Q3692861"

The following pages link to A Lower Bound for the Formula Size of Rational Functions (Q3692861):

Displaying 24 items.

• Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
• Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
• Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
• A lower bound on determinantal complexity (Q2087768) (← links)
• Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
• Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
• Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
• Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
• A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
• Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
• Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
• Algebraic Complexity Classes (Q2821695) (← links)
• A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
• Explicit Tensors (Q2821697) (← links)
• Types of depth and formula size (Q2920906) (← links)
• Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
• The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
• A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• (Q5121899) (← links)
• (Q5121901) (← links)
• Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
• Hay from the haystack: explicit examples of exponential quantum circuit complexity (Q6109366) (← links)
• Determinants vs. algebraic branching programs (Q6624427) (← links)