The Computational Power of Depth Five Arithmetic Circuits (Q4629389): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: lowerbounds-survey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields / 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: Q4542578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A Chasm at Depth 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching the Chasm at Depth Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Evaluation of Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Formula Size of Rational Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas / 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: Q4601827 / 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: Arithmetic circuits: the chasm at depth four gets wider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111162 / 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: On the Power of Homogeneous Depth 4 Arithmetic Circuits / 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: Tensor-rank and lower bounds for arithmetic formulas / 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: 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/18m1173319 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2917030467 / rank
 
Normal rank

Latest revision as of 09:36, 30 July 2024

scientific article; zbMATH DE number 7040641
Language Label Description Also known as
English
The Computational Power of Depth Five Arithmetic Circuits
scientific article; zbMATH DE number 7040641

    Statements

    The Computational Power of Depth Five Arithmetic Circuits (English)
    0 references
    0 references
    0 references
    22 March 2019
    0 references
    arithmetic circuits
    0 references
    lower bounds
    0 references
    shifted partials
    0 references
    depth reductions
    0 references
    projected shifted partials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers