二次规划 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "二次规划" in Chinese language version.

refsWebsite

Global rank Chinese rank

2^nd place

23^rd place

1web.archive.org

1^st place

1^st place

207^th place

628^th place

921^st place

1,407^th place

1semanticscholar.org

11^th place

332^nd place

doi.org (Global: 2^nd place; Chinese: 23^rd place)

Sahni, S. Computationally related problems (PDF). SIAM Journal on Computing. 1974, 3 (4): 262–279 [2022-09-07]. CiteSeerX 10.1.1.145.8685 . doi:10.1137/0203021. （原始内容 (PDF)存档于2022-04-26）.
Pardalos, Panos M.; Vavasis, Stephen A. Quadratic programming with one negative eigenvalue is (strongly) NP-hard. Journal of Global Optimization. 1991, 1 (1): 15–22. S2CID 12602885. doi:10.1007/bf00120662.

psu.edu (Global: 207^th place; Chinese: 628^th place)

citeseerx.ist.psu.edu

Sahni, S. Computationally related problems (PDF). SIAM Journal on Computing. 1974, 3 (4): 262–279 [2022-09-07]. CiteSeerX 10.1.1.145.8685 . doi:10.1137/0203021. （原始内容 (PDF)存档于2022-04-26）.

semanticscholar.org (Global: 11^th place; Chinese: 332^nd place)

api.semanticscholar.org

Pardalos, Panos M.; Vavasis, Stephen A. Quadratic programming with one negative eigenvalue is (strongly) NP-hard. Journal of Global Optimization. 1991, 1 (1): 15–22. S2CID 12602885. doi:10.1007/bf00120662.

ufl.edu (Global: 921^st place; Chinese: 1,407^th place)

cise.ufl.edu

Sahni, S. Computationally related problems (PDF). SIAM Journal on Computing. 1974, 3 (4): 262–279 [2022-09-07]. CiteSeerX 10.1.1.145.8685 . doi:10.1137/0203021. （原始内容 (PDF)存档于2022-04-26）.

web.archive.org (Global: 1^st place; Chinese: 1^st place)

Sahni, S. Computationally related problems (PDF). SIAM Journal on Computing. 1974, 3 (4): 262–279 [2022-09-07]. CiteSeerX 10.1.1.145.8685 . doi:10.1137/0203021. （原始内容 (PDF)存档于2022-04-26）.