Deciding uniqueness in norm maximazation (Q687086): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational complexity of norm-maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank

Latest revision as of 10:15, 22 May 2024

scientific article
Language Label Description Also known as
English
Deciding uniqueness in norm maximazation
scientific article

    Statements

    Identifiers

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