TOP
英國出版界指標大獎肯定!A.F. Steadman 獲年度作家,《史坎德》系列帶你踏上熱血奇幻旅程
搜尋結果 /

Complexity and Approximability Properties

共 3 筆
第1 / 1 頁
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, alg
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Feasible Computations and Provable Complexity Properties
90 折
出版日:1987/02/01 作者:Juris Hartmanis  出版社:Cambridge University Press  裝訂:平裝
An overview of current developments in research on feasible computations. Defines and discusses efficient reductions between problems and considers the families and corresponding complete languages of
優惠價: 9 1661
無庫存
出版日:2023/07/18 作者:Dimitris Bertsimas  出版社:LEGARE STREET PR  裝訂:平裝
定價:698 元
無庫存
  • 共 3筆
    第 1 頁

暢銷榜

客服中心

收藏

會員專區