跳至内容
Computational complexity and the traveling salesman problem 線上預覽
關閉線上預覽
正在查...

Computational complexity and the traveling salesman problem

作者: David S Johnson; Christos H Papadimitriou
出版商: Cambridge : Massachusetts Institute of Technology, 1981.
叢書: Massachusetts Institute of Technology.; Laboratory for Computer Science.; Technical memorandum
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫:WorldCat
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

文件類型: 圖書
所有的作者/貢獻者: David S Johnson; Christos H Papadimitriou
OCLC系統控制編碼: 9157771
注意: "This is a draft of the Third Chapter in the forthcoming book 'The traveling salesman problem, ' edited by E.L. Lawler, J.K. Lenstra, and A.G. Rinooy Kan, to be published by John Wiley and Sons."
描述: 38, [24] pages ; 28 cm.
叢書名: Massachusetts Institute of Technology.; Laboratory for Computer Science.; Technical memorandum
責任: David Johnson, Christos H. Papadimitriou.

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/9157771>
library:oclcnum"9157771"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/9157771>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/1155795>
rdf:typeschema:Intangible
schema:name"Traveling salesman problem"@en
schema:name"Traveling salesman problem."@en
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"@en
schema:name"Computational complexity."@en
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1981"
schema:exampleOfWork<http://worldcat.org/entity/work/id/14453910>
schema:inLanguage"en"
schema:name"Computational complexity and the traveling salesman problem"@en
schema:publisher
schema:url

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.