Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Lower bounds for matrix factorization - MaRDI portal

Lower bounds for matrix factorization (Q2041242)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Lower bounds for matrix factorization

scientific article; zbMATH DE number 7372271

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

Statements

scholarly article

0 references

Lower bounds for matrix factorization (English)

0 references

0 references

0 references

Computational Complexity

0 references

publication date

16 July 2021

0 references

full work available at URL

https://arxiv.org/abs/1904.01182

0 references

zbMATH Keywords

algebraic complexity

0 references

linear circuits

0 references

matrix factorization

0 references

lower bounds

0 references

MaRDI profile type

0 references

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

0 references

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits

0 references

Probabilistic rank and matrix rigidity

0 references

Superconcentrators of depths 2 and 3; odd levels help (rarely)

0 references

Descartes' Rule of Signs Revisited

0 references

The complexity of partial derivatives

0 references

An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy

0 references

Testers and their applications

0 references

0 references

Explicit two-source extractors and resilient functions

0 references

0 references

Towards optimal two-source extractors and Ramsey graphs

0 references

Matrix rigidity and the Croot-Lev-Pach lemma

0 references

Static data structure lower bounds imply rigidity

0 references

Fourier and Circulant Matrices are Not Rigid

0 references

On identity testing of tensors, low-rank recovery and compressed sensing

0 references

The Complexity of Maintaining an Array and Computing Its Partial Sums

0 references

A note on matrix rigidity

0 references

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates

0 references

Arithmetic circuits: a chasm at depth 3

0 references

Complexity of Linear Boolean Operators

0 references

Arithmetic circuits: the chasm at depth four gets wider

0 references

Lower bounds for matrix factorization

0 references

The cell probe complexity of dynamic range counting

0 references

On Range Searching in the Group Model and Combinatorial Discrepancy

0 references

Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds

0 references

0 references

Complexity Lower Bounds using Linear Algebra

0 references

Online learning for matrix factorization and sparse coding

0 references

Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

0 references

0 references

Logarithmic Lower Bounds in the Cell-Probe Model

0 references

Superconcentrators

0 references

Superconcentrators of depth 2

0 references

Communication in bounded depth circuits

0 references

A note on the use of determinant for proving lower bounds on the size of linear circuits

0 references

Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

0 references

0 references

Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates

0 references

A remark on matrix rigidity

0 references

New Algorithms for Finding Irreducible Polynomials Over Finite Fields

0 references

Lower bounds for polynomial evaluation and interpolation problems

0 references

Arithmetic Circuits: A survey of recent results and open questions

0 references

Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten

0 references

Improved bounds for reduction to depth 4 and depth 3

0 references

0 references

0 references

Recommended article

Lower bounds for matrix factorization

Similarity Score

1.0000004

Recommender Run

Recommender Run 2

0 references

Lower bounds for the low-rank matrix approximation

Similarity Score

0.93336606

Recommender Run

Recommender Run 2

0 references

Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Similarity Score

0.90941584

Recommender Run

Recommender Run 2

0 references

Randomized algorithms for low-rank matrix factorizations: sharp performance bounds

Similarity Score

0.9066616

Recommender Run

Recommender Run 2

0 references

Bounded Matrix Low Rank Approximation

Similarity Score

0.8873685

Recommender Run

Recommender Run 2

0 references

Lower bounds for matrices

Similarity Score

0.885352

Recommender Run

Recommender Run 2

0 references

Lower bounds for some factorable matrices

Similarity Score

0.88417506

Recommender Run

Recommender Run 2

0 references

Lower bounds of matrices

Similarity Score

0.88376033

Recommender Run

Recommender Run 2

0 references

A matrix lower bound

Similarity Score

0.8829293

Recommender Run

Recommender Run 2

0 references

Lower bounds in minimum rank problems

Similarity Score

0.88090384

Recommender Run

Recommender Run 2

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00037-021-00205-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2041242

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Item:Q2041242&oldid=43488685"