Lower bounds for matrix factorization (Q5092452): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Lower bounds for matrix factorization
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.CCC.2020.5 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic rank and matrix rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators of depths 2 and 3; odd levels help (rarely) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testers and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit two-source extractors and resilient functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal two-source extractors and Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix rigidity and the Croot-Lev-Pach lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static data structure lower bounds imply rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identity testing of tensors, low-rank recovery and compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Maintaining an Array and Computing Its Partial Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on matrix rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cell probe complexity of succinct data structures / 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: Complexity of Linear Boolean Operators / 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 cell probe complexity of dynamic range counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Range Searching in the Group Model and Combinatorial Discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Lower Bounds using Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Lower Bounds in the Cell-Probe Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators of depth 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication in bounded depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the use of determinant for proving lower bounds on the size of linear circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on matrix rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for polynomial evaluation and interpolation problems / 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: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / 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: Q4138137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.CCC.2020.5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964003194 / rank
 
Normal rank
Property / title
 
Lower bounds for matrix factorization (English)
Property / title: Lower bounds for matrix factorization (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.CCC.2020.5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 30 December 2024

scientific article; zbMATH DE number 7561733
Language Label Description Also known as
English
Lower bounds for matrix factorization
scientific article; zbMATH DE number 7561733

    Statements

    0 references
    0 references
    21 July 2022
    0 references
    algebraic complexity
    0 references
    linear circuits
    0 references
    matrix factorization
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Lower bounds for matrix factorization (English)
    0 references

    Identifiers