积和式 (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

8,783^rd place

low place

1web.archive.org

1^st place

1^st place

610^th place

388^th place

1,185^th place

809^th place

acm.org

portal.acm.org

Jerrum, Mark; Sinclair, Alistair; Vigoda, Eric. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 (Hersonissos, Greece: ACM Press). 2001: 712–721. ISBN 978-1-58113-349-3. doi:10.1145/380752.380877 （英语）.

doi.org

Shevelev, V.S. On a representation of rook polinomials. Russian Mathematical Surveys. 1990, 45 (4): 183–185. doi:10.1070/RM1990v045n04ABEH002387 （英语）.
Valiant, L.G. The complexity of computing the permanent. Theoretical Computer Science. 1979, 8 (2): 189–201 [2020-10-21]. doi:10.1016/0304-3975(79)90044-6. （原始内容存档于2021-03-08）（英语）.
Jerrum, Mark; Sinclair, Alistair; Vigoda, Eric. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 (Hersonissos, Greece: ACM Press). 2001: 712–721. ISBN 978-1-58113-349-3. doi:10.1145/380752.380877 （英语）.

elsevier.com

linkinghub.elsevier.com

Valiant, L.G. The complexity of computing the permanent. Theoretical Computer Science. 1979, 8 (2): 189–201 [2020-10-21]. doi:10.1016/0304-3975(79)90044-6. （原始内容存档于2021-03-08）（英语）.

mathnet.ru

Shevelev, V.S. On a representation of rook polinomials. Russian Mathematical Surveys. 1990, 45 (4): 183–185. doi:10.1070/RM1990v045n04ABEH002387 （英语）.

web.archive.org

Valiant, L.G. The complexity of computing the permanent. Theoretical Computer Science. 1979, 8 (2): 189–201 [2020-10-21]. doi:10.1016/0304-3975(79)90044-6. （原始内容存档于2021-03-08）（英语）.