On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2801809571 / rank | |||
Normal rank | |||
Revision as of 23:10, 19 March 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
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
