The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (Q3451754): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Shubhangi Saraf / rank
Normal rank
 
Property / author
 
Property / author: Shubhangi Saraf / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1900995703 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.6716 / 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: 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: Approaching the Chasm at Depth Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of depth-4 multilinear circuits with top fan-in 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in / 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: A super-polynomial lower bound for regular arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box identity testing of depth-4 multilinear circuits / 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: Arithmetic Circuits: A survey of recent results and open questions / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:58, 11 July 2024

scientific article
Language Label Description Also known as
English
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In
scientific article

    Statements

    The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (English)
    0 references
    0 references
    0 references
    18 November 2015
    0 references
    arithmetic circuits
    0 references
    lower bounds
    0 references
    depth reduction
    0 references

    Identifiers

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