On the nonnegative rank of distance matrices (Q436566): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A03 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B48 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A23 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6059686 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
nonnegative rank
Property / zbMATH Keywords: nonnegative rank / rank
 
Normal rank
Property / zbMATH Keywords
 
Euclidean distance
Property / zbMATH Keywords: Euclidean distance / rank
 
Normal rank
Property / zbMATH Keywords
 
Boolean formula
Property / zbMATH Keywords: Boolean formula / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023307697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real rank versus nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex complexity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonnegative rank of Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of matrix methods to the theory of lower bounds in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:36, 5 July 2024

scientific article
Language Label Description Also known as
English
On the nonnegative rank of distance matrices
scientific article

    Statements

    Identifiers

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