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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Piecewise linear methods for nonlinear equations and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Tarski's fixed point theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations and simplicial methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Arbitrary Starting Homotopy-Like Simplicial Algorithm for Computing an Integer Point in a Class of Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplicial Approach to the Determination of an Integer Point of a Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points on unbounded regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all equilibria in games of strategic complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core many-to-one matchings by fixed-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fixed-Point Approach to Stable Matchings and Some Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplizialzerlegungen von beschränkter Flachheit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Aggregation of Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMPLICIAL APPROXIMATION OF FIXED POINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restart algorithm for computing fixed points without an extra dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Comparative Statics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximation of Fixed Points of a Continuous Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of fixed points and applications / rank
 
Normal rank

Revision as of 19:56, 15 July 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