A FULL POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR GENERALIZED LINEAR MULTIPLICATIVE PROBLEMS

Shen Peiping, Shen Zihui

Mathematica Numerica Sinica ›› 2017, Vol. 39 ›› Issue (3) : 287-294.

PDF(312 KB)
中国科学院数学与系统科学研究院期刊网
PDF(312 KB)
Mathematica Numerica Sinica ›› 2017, Vol. 39 ›› Issue (3) : 287-294. DOI: 10.12286/jssx.2017.3.287
Reviews

A FULL POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR GENERALIZED LINEAR MULTIPLICATIVE PROBLEMS

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
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}}. Mathematica Numerica Sinica, 2017, 39(3): 287-294 https://doi.org/10.12286/jssx.2017.3.287

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(312 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉