DISCOVERING NON-TERMINATING INPUTS FOR MULTI-PATH POLYNOMIAL PROGRAMS

LIU Jiang,XU Ming, ZHAN Naijun, ZHAO Hengjun

Journal of Systems Science & Complexity ›› 2014, Vol. 27 ›› Issue (6) : 1286-1304.

PDF(303 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(303 KB)
Journal of Systems Science & Complexity ›› 2014, Vol. 27 ›› Issue (6) : 1286-1304. DOI: 10.1007/s11424-014-2145-6

DISCOVERING NON-TERMINATING INPUTS FOR MULTI-PATH POLYNOMIAL PROGRAMS

  • LIU Jiang 1, XU Ming2, ZHAN Naijun3, ZHAO Hengjun4
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Systems Science and Complexity, 2014, 27(6): 1286-1304 https://doi.org/10.1007/s11424-014-2145-6

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(303 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉