Erratum/Correction to “On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45]

Chuangyin Dang; Yinyu Ye

doi:10.1016/j.tcs.2019.03.014

Erratum/Correction to “On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45]

Chuangyin Dang^*, Yinyu Ye

^*Corresponding author for this work

Research output: Journal Publications and Reviews › Erratum › peer-review

1 Citation (Scopus)

Original language	English
Pages (from-to)	80
Journal	Theoretical Computer Science
Volume	817
Online published	15 Mar 2019
DOIs	https://doi.org/10.1016/j.tcs.2019.03.014
Publication status	Published - 12 May 2020

Access Output

10.1016/j.tcs.2019.03.014

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{05d850cd195e46969905726e31e5cf98,

title = "Erratum/Correction to “On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45]",

author = "Chuangyin Dang and Yinyu Ye",

year = "2020",

month = may,

day = "12",

doi = "10.1016/j.tcs.2019.03.014",

language = "English",

volume = "817",

pages = "80",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Erratum/Correction to “On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45]

AU - Dang, Chuangyin

AU - Ye, Yinyu

PY - 2020/5/12

Y1 - 2020/5/12

UR - http://www.scopus.com/inward/record.url?scp=85062973855&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85062973855&origin=recordpage

U2 - 10.1016/j.tcs.2019.03.014

DO - 10.1016/j.tcs.2019.03.014

M3 - Erratum

SN - 0304-3975

VL - 817

SP - 80

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Erratum/Correction to “On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering” [Theor. Comput. Sci. 732 (2018) 26–45]

Access Output

Other Access Options

Permanent Link

Other Files and Links

Research output

On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering

Cite this