The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-48054-0_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1447393214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbed Identity Matrices Have High Rank: Proof and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for depth 4 formulas computing iterated matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching the Chasm at Depth Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous formulas and symmetric polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A super-polynomial lower bound for regular arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic circuits: the chasm at depth four gets wider / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limits of depth reduction for arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on arithmetic circuits via partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-linear formulas for permanent and determinant are of super-polynomial size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine projections of symmetric polynomials. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-3 arithmetic circuits over fields of characteristic zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Reduction to Depth 4 and Depth 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets / rank
 
Normal rank

Latest revision as of 18:23, 10 July 2024

scientific article
Language Label Description Also known as
English
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
scientific article

    Statements

    The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references