分区问题 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "分区问题" in Chinese language version.
refsWebsite
Global rank
Chinese rank
1st place
1st place
5th place
12th place
low place
low place
3rd place
8th place
6th place
4th place
archive.org
- Garey, Michael; Johnson, David. Computers and Intractability; A Guide to the Theory of NP-Completeness. 1979: 96–105. ISBN 978-0-7167-1045-5.
bit-player.org
- Hayes, Brian, The Easiest Hard Problem (PDF), American Scientist, vol. 90 no. 2 (Sigma Xi, The Scientific Research Society), March–April 2002: 113–117 [2022-03-01], JSTOR 27857621, （原始内容存档 (PDF)于2012-09-16）
books.google.com
- Mertens 2006，第125頁.
doi.org
- Korf 1998. Korf, Richard E., A complete anytime algorithm for number partitioning, Artificial Intelligence, 1998, 106 (2): 181–203, CiteSeerX 10.1.1.90.993
, ISSN 0004-3702, doi:10.1016/S0004-3702(98)00086-1
ijcai.org
- Korf, Richard E. Multi-Way Number Partitioning (PDF). IJCAI. 2009 [2022-03-01]. （原始内容存档 (PDF)于2014-11-27）.
jstor.org
- Hayes, Brian, The Easiest Hard Problem (PDF), American Scientist, vol. 90 no. 2 (Sigma Xi, The Scientific Research Society), March–April 2002: 113–117 [2022-03-01], JSTOR 27857621, （原始内容存档 (PDF)于2012-09-16）
psu.edu
citeseerx.ist.psu.edu
- Korf 1998. Korf, Richard E., A complete anytime algorithm for number partitioning, Artificial Intelligence, 1998, 106 (2): 181–203, CiteSeerX 10.1.1.90.993 , ISSN 0004-3702, doi:10.1016/S0004-3702(98)00086-1
web.archive.org
- Hayes, Brian, The Easiest Hard Problem (PDF), American Scientist, vol. 90 no. 2 (Sigma Xi, The Scientific Research Society), March–April 2002: 113–117 [2022-03-01], JSTOR 27857621, （原始内容存档 (PDF)于2012-09-16）
- Korf, Richard E. Multi-Way Number Partitioning (PDF). IJCAI. 2009 [2022-03-01]. （原始内容存档 (PDF)于2014-11-27）.
worldcat.org
- Korf 1998. Korf, Richard E., A complete anytime algorithm for number partitioning, Artificial Intelligence, 1998, 106 (2): 181–203, CiteSeerX 10.1.1.90.993 , ISSN 0004-3702, doi:10.1016/S0004-3702(98)00086-1