On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.04.021 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.04.021 / rank
 
Normal rank

Latest revision as of 23:56, 10 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
scientific article

    Statements

    On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (English)
    0 references
    0 references
    0 references
    7 June 2018
    0 references
    lattice of integer points
    0 references
    componentwise ordering
    0 references
    increasing mapping
    0 references
    fixed point
    0 references
    Tarski's fixed-point theorem
    0 references
    integer labeling
    0 references
    triangulation
    0 references
    PPA
    0 references
    simplicial method
    0 references
    0 references
    0 references
    0 references

    Identifiers

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