Partial derivatives in arithmetic complexity and beyond
arithmetic complexitycomplexity of polynomialsmultivariate polynomialpartial derivativesupper and lower bounds
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Polynomials, factorization in commutative rings (13P05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
- The complexity of partial derivatives
- Deterministic polynomial identity testing in non-commutative models
- Representation of monomials as a sum of powers of linear forms
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- A \(\tau \)-conjecture for Newton polygons
- Geometric complexity theory: an introduction for geometers
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- There is no efficient reverse derivation mode for discrete derivatives
- Exact learning from an honest teacher that answers membership queries
- A restriction estimate using polynomial partitioning
- Jacobian hits circuits: hitting sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits
- A Selection of Lower Bounds for Arithmetic Circuits
- Tropical complexity, Sidon sets, and dynamic programming
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
- An exponential lower bound for homogeneous depth four arithmetic formulas
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- scientific article; zbMATH DE number 3931010 (Why is no real title available?)
- scientific article; zbMATH DE number 3949711 (Why is no real title available?)
- scientific article; zbMATH DE number 4059392 (Why is no real title available?)
- On the complexity of partial derivatives
- scientific article; zbMATH DE number 2163029 (Why is no real title available?)
- Flattenings and Koszul Young flattenings arising in complexity theory
- Barriers for rank methods in arithmetic complexity
- scientific article; zbMATH DE number 7559443 (Why is no real title available?)
- On the Symmetries of and Equivalence Test for Design Polynomials.
- scientific article; zbMATH DE number 7561742 (Why is no real title available?)
- A super-quadratic lower bound for depth four arithmetic circuits
- On homogeneous polynomials determined by their partial derivatives
- Making the Case for Pseudodifferential Arithmetic
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- Fundamental invariants of orbit closures
- On the multiplicative complexity of polynomials
- Lower bounds for the sum of small-size algebraic branching programs
- Notes on Boolean read-k and multilinear circuits
- Oscillatory integral operators and variable Schrödinger propagators: beyond the universal estimates
- Geometric complexity theory for product-plus-power
- Lower bounds for planar arithmetic circuits
- Improved lower bound, and proof barrier, for constant depth algebraic circuits
- Lower bounds for the sum of small-size algebraic branching programs
- Lower bounds for planar arithmetic circuits
- Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set
This page was built for publication: Partial derivatives in arithmetic complexity and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872492)
