Factoring a band matrix over a semiring
From MaRDI portal
Publication:2041261
DOI10.1016/j.fss.2019.02.004zbMath1465.15020OpenAlexW2913096529WikidataQ128490835 ScholiaQ128490835MaRDI QIDQ2041261
Publication date: 16 July 2021
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2019.02.004
Factorization of matrices (15A23) Max-plus and related algebras (15A80) Special matrices (15B99) Fuzzy matrices (15B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on square roots of nonnegative matrices
- Nonnegative square roots of matrices
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Positive semidefinite rank
- Tropical secant varieties of linear spaces
- Optimal triangular decompositions of matrices with entries from residuated lattices
- Bipartite dimensions and bipartite degrees of graphs
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Expressing combinatorial optimization problems by linear programs
- Metamathematics of fuzzy logic
- Communication complexity and combinatorial lattice theory
- Ranks of fuzzy matrices. Applications in state reduction of fuzzy automata
- Combinatorial bounds on nonnegative rank and extended formulations
- Bandwidth contrained NP-complete problems
- Factor analysis of ordinal data via decomposition of matrices with grades
- Fixed points of the EM algorithm and nonnegative rank boundaries
- The complexity of tropical matrix factorization
- Detecting matrices of combinatorial rank three
- Parametrized complexity theory.
- On the Complexity of Nonnegative Matrix Factorization
- Factor Analysis of Incidence Data via Novel Decomposition of Matrices
- Matrix Analysis
- Minimal NFA Problems are Hard
- Matrices of Bounded Psd Rank are Easy to Detect
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions
- Two Algorithmic Results for the Traveling Salesman Problem
- Optimal decompositions of matrices with entries from residuated lattices
- Learning the parts of objects by non-negative matrix factorization
- The Complexity of Positive Semidefinite Matrix Factorization
- Positive semidefinite rank and nested spectrahedra
- Linear vs. semidefinite extended formulations
- Computing a nonnegative matrix factorization -- provably
