The quadratic M-convexity testing problem (Q1701120): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1704.02836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing trees from distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid tractability of valued constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids: A new look at the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(M\)-convex functions and tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convexity in joint winner property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Developments in Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic M-convex and L-convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank

Latest revision as of 04:44, 15 July 2024

scientific article
Language Label Description Also known as
English
The quadratic M-convexity testing problem
scientific article

    Statements

    Identifiers