Pages that link to "Item:Q2872492"

The following pages link to Partial derivatives in arithmetic complexity and beyond (Q2872492):

Displaying 34 items.

• Fundamental invariants of orbit closures (Q517074) (← links)
• The complexity of partial derivatives (Q1171380) (← links)
• Deterministic polynomial identity testing in non-commutative models (Q1781113) (← links)
• Representation of monomials as a sum of powers of linear forms (Q2018019) (← links)
• Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages (Q2056737) (← links)
• A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
• Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
• There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• A restriction estimate using polynomial partitioning (Q2792314) (← links)
• Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
• A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
• Tropical complexity, Sidon sets, and dynamic programming (Q2832574) (← links)
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
• An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE (Q3212290) (← links)
• (Q3705454) (← links)
• (Q3719829) (← links)
• (Q3794178) (← links)
• On the complexity of partial derivatives (Q4636636) (← links)
• (Q4673416) (← links)
• Flattenings and Koszul Young flattenings arising in complexity theory (Q4977660) (← links)
• Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
• (Q5089246) (← links)
• On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
• (Q5092463) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• On Homogeneous Polynomials Determined by their Partial Derivatives (Q5108000) (← links)
• Making the Case for Pseudodifferential Arithmetic (Q5118513) (← links)
• Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q5121899) (← links)
• On the multiplicative complexity of polynomials (Q6548983) (← links)
• Lower bounds for the sum of small-size algebraic branching programs (Q6636102) (← links)
• Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)