Factoring a band matrix over a semiring
type: Item
instance of: scholarly article
title: Factoring a band matrix over a semiring
zbMATH Open document ID: 1465.15020
published in: Fuzzy Sets and Systems
publication date: 2021-07-16T00:00:00Z
Mathematics Subject Classification ID: 15A23
Mathematics Subject Classification ID: 15A80
Mathematics Subject Classification ID: 15B15
Mathematics Subject Classification ID: 15B99
zbMATH DE Number: 7372311
zbMATH Keywords: nonnegative matrix factorization
zbMATH Keywords: tropical mathematics
zbMATH Keywords: t-norm logic
zbMATH Keywords: band matrices
author: Ya. N. Shitov
MaRDI profile type: Publication
full work available at URL: j.fss.2019.02.004
OpenAlex ID: W2913096529
cites work: Computing a nonnegative matrix factorization -- provably
cites work: Two Algorithmic Results for the Traveling Salesman Problem
cites work: Q4461914
cites work: Q3840359
cites work: Optimal triangular decompositions of matrices with entries from residuated lattices
cites work: Optimal decompositions of matrices with entries from residuated lattices
cites work: Factor Analysis of Incidence Data via Novel Decomposition of Matrices
cites work: Factor analysis of ordinal data via decomposition of matrices with grades
cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
cites work: Tropical secant varieties of linear spaces
cites work: Q5290261
cites work: Positive semidefinite rank
cites work: Combinatorial bounds on nonnegative rank and extended formulations
cites work: Linear vs. semidefinite extended formulations
cites work: Bipartite dimensions and bipartite degrees of graphs
cites work: Parametrized complexity theory.
cites work: Metamathematics of fuzzy logic
cites work: Matrix Analysis
cites work: Minimal NFA Problems are Hard
cites work: Fixed points of the EM algorithm and nonnegative rank boundaries
cites work: Positive semidefinite rank and nested spectrahedra
cites work: Learning the parts of objects by non-negative matrix factorization
cites work: Communication complexity and combinatorial lattice theory
cites work: Bandwidth contrained NP-complete problems
cites work: Q4152571
cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
cites work: Detecting matrices of combinatorial rank three
cites work: A note on square roots of nonnegative matrices
cites work: The complexity of tropical matrix factorization
cites work: The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions
cites work: The Complexity of Positive Semidefinite Matrix Factorization
cites work: Matrices of Bounded Psd Rank are Easy to Detect
cites work: Ranks of fuzzy matrices. Applications in state reduction of fuzzy automata
cites work: Nonnegative square roots of matrices
cites work: On the Complexity of Nonnegative Matrix Factorization
cites work: Expressing combinatorial optimization problems by linear programs
Wikidata QID: Q128490835
DOI: 10.1016/J.FSS.2019.02.004
description: scientific article; zbMATH DE number 7372311