算法 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "算法" in Chinese language version.
Last modified:
Ref.Un. Ref.Website
Global rank
Chinese rank
1st place
1st place
6th place
2nd place
382nd place
208th place
low place
low place
low place
low place
182nd place
219th place
15th place
141st place
3rd place
6th place
51cto.com (Global: low place; Chinese: 9,149th place)
book.51cto.com
archive.org (Global: 6th place; Chinese: 2nd place)
- Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein; 殷建平等译. 第1章 算法在计算机中的作用. 算法导论 原书第3版. 北京: 机械工业出版社. 2013年1月: 3[5] [2017-11-14]. ISBN 978-7-111-40701-0 （中文）.
- For instance, the volume of a convex polytope （described using a membership oracle） can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi. A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies. J. ACM. January 1991, 38 (1): 1–17. CiteSeerX 10.1.1.145.4600
. S2CID 13268711. doi:10.1145/102782.102783.
books.google.com (Global: 3rd place; Chinese: 6th place)
- Tsypkin. Adaptation and learning in automatic systems. Academic Press. 1971: 54. ISBN 978-0-08-095582-7.
doi.org (Global: 2nd place; Chinese: 5th place)
- Kellerer, Hans; Pferschy, Ulrich; Pisinger, David. Knapsack Problems | Hans Kellerer | Springer. Springer. 2004 [September 19, 2017]. ISBN 978-3-540-40286-2. doi:10.1007/978-3-540-24777-7. （原始内容存档于October 18, 2017） （英语）.
- For instance, the volume of a convex polytope （described using a membership oracle） can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi. A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies. J. ACM. January 1991, 38 (1): 1–17. CiteSeerX 10.1.1.145.4600 . S2CID 13268711. doi:10.1145/102782.102783.
guardian.co.uk (Global: 382nd place; Chinese: 208th place)
- Ada Lovelace honoured by Google doodle. The Guardian. 10 December 2012 [10 December 2012]. （原始内容存档于2018-12-25）.
hnust.edu.cn (Global: low place; Chinese: low place)
acm.hnust.edu.cn
- 实验3-9：循环打擂. 湖南科技大学程序设计在线评测（Online Judge）.[永久失效連結]
psu.edu (Global: 299th place; Chinese: 591st place)
citeseer.ist.psu.edu
- Moschovakis, Yiannis N. What is an algorithm?. Engquist, B.; Schmid, W. (编). Mathematics Unlimited—2001 and beyond. Springer. 2001: 919–936 （Part II） [2012-09-27]. （原始内容存档于2021-04-24）.
citeseerx.ist.psu.edu
- For instance, the volume of a convex polytope （described using a membership oracle） can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi. A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies. J. ACM. January 1991, 38 (1): 1–17. CiteSeerX 10.1.1.145.4600 . S2CID 13268711. doi:10.1145/102782.102783.
semanticscholar.org (Global: 15th place; Chinese: 141st place)
api.semanticscholar.org
- For instance, the volume of a convex polytope （described using a membership oracle） can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi. A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies. J. ACM. January 1991, 38 (1): 1–17. CiteSeerX 10.1.1.145.4600 . S2CID 13268711. doi:10.1145/102782.102783.
springer.com (Global: 182nd place; Chinese: 219th place)
- Kellerer, Hans; Pferschy, Ulrich; Pisinger, David. Knapsack Problems | Hans Kellerer | Springer. Springer. 2004 [September 19, 2017]. ISBN 978-3-540-40286-2. doi:10.1007/978-3-540-24777-7. （原始内容存档于October 18, 2017） （英语）.
web.archive.org (Global: 1st place; Chinese: 1st place)
- Moschovakis, Yiannis N. What is an algorithm?. Engquist, B.; Schmid, W. (编). Mathematics Unlimited—2001 and beyond. Springer. 2001: 919–936 （Part II） [2012-09-27]. （原始内容存档于2021-04-24）.
- Ada Lovelace honoured by Google doodle. The Guardian. 10 December 2012 [10 December 2012]. （原始内容存档于2018-12-25）.
- 2.4 赛场统分. 读书频道-IT技术图书-51CTO.COM. [2017-06-07]. （原始内容存档于2017-03-24）.
- 高中,算法与程序设计,教案. 在点网. [2017-06-07]. （原始内容存档于2019-06-03）.
- Kellerer, Hans; Pferschy, Ulrich; Pisinger, David. Knapsack Problems | Hans Kellerer | Springer. Springer. 2004 [September 19, 2017]. ISBN 978-3-540-40286-2. doi:10.1007/978-3-540-24777-7. （原始内容存档于October 18, 2017） （英语）.
zaidian.com (Global: low place; Chinese: low place)
- 高中,算法与程序设计,教案. 在点网. [2017-06-07]. （原始内容存档于2019-06-03）.