感謝大家支持,開設26週年WWW.PUNCHBROTHERSTOUR.THECHAINSMOKERSTOURDATES.COM 創業慶

WWW.PUNCHBROTHERSTOUR.THECHAINSMOKERSTOURDATES.COM

詳細請見這裡
我的商店 我的商店 變更
  • 當日配送
  • 廣告
  • 可保留
  • 店舖取貨

Complexity Theory of Real Functions/ Ko, Ker-I葛可一/1991 N1

※WWW.PUNCHBROTHERSTOUR.THECHAINSMOKERSTOURDATES.COM 限定款式
YouTuber 為大家介紹商品的使用感受!
介紹影片請見這裡

網路販售
價格(含稅)

945元

  • 登錄科梅利卡號並使用科梅利卡付款即可
    科梅利點數 : 217獲得點數

關於科梅利點數

減少購買數量
增加購買數量

到店取貨 到店取貨
(免運費)

取貨店舖:

選擇店舖

確認附近店舖

預計交貨時間:

13時前下單→17時前備妥

17時前下單→隔天早上前備妥

關於取貨方式與運費

加入購物車

配送 配送

預計交貨時間:

11月23日左右預計送達。

僅限信用卡或貨到付款。若使用其他付款方式,請這裡確認相關資訊。

※若於週末、國定假日下單,或因庫存狀況影響,商品送達可能需要較長時間。

關於當日出貨條件

關於取貨方式與運費

加入購物車

加入願望清單

已加入願望清單

Complexity Theory of Real Functions/ Ko, Ker-I葛可一/1991 N1的詳細資訊

 Complexity Theory of Real Functions(Progress in theoretical computer science)/Ko, Ker-I葛可一/1991  書況 精裝如圖示 無劃線註記 內頁乾淨 約8成新 書頁些許自然泛黃 書長約24公分 簡介:Starting with Cook\'s pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com­ putability, has quickly emerged as the new foundation of algorithms. On the one hand, it bridges the gap between the abstract approach of recursive function theory and the concrete approach of analysis of algorithms. It extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. In addition, the theoretical studies of the notion of polynomial-time tractability some­ times also yield interesting new practical algorithms. A typical exam­ ple is the application of the ellipsoid algorithm to combinatorial op­ timization problems (see, for example, Lovasz [1986]). On the other hand, it has a strong influence on many different branches of mathe­ matics, including combinatorial optimization, graph theory, number theory and cryptography. As a consequence, many researchers have begun to re-examine various branches of classical mathematics from the complexity point of view. For a given nonconstructive existence theorem in classical mathematics, one would like to find a construc­ tive proof which admits a polynomial-time algorithm for the solution. One of the examples is the recent work on algorithmic theory of per­ mutation groups. In the area of numerical computation, there are also two tradi­ tionally independent approaches: recursive analysis and numerical analysis. 商品備註・物品狀況:使用未滿半年・最新關注時間:2024-12-28
  • Complexity Theory of Real Functions/ Ko, Ker-I葛可一/1991 N1
  • What is complexity theory and why does it matter?
  • 可制御性スコアについて - 佐藤一宏
  • What is Complexity Theory?. Complexities in various sectors, Tools
  • Complexity Theory of Outcome Creation – Complex Systems Frameworks
  • Complexity Theory of Outcome Creation – Complex Systems Frameworks
  • 神話・狂気・哄笑 ドイツ観念論における主体性 (nyx叢書) | マルクス
  • Amazon | Complexity Theory of Real Functions (Progress in
  • 81ea1HDoOAL._AC_UF350,
  • 臨床組織科学(COS)の場の勾配理論──Field Gradient Theoryと2-on-1
  • Theory Of Functions的優惠比較- 2026年09月|飛比價格
  • 強化学習入門 Part2 - TensorflowとKerasとOpenAI GymでPolicy
  • Theory Of Functions的優惠比較- 2026年09月|飛比價格
  • CCA Net - Textbooks and Monographs
  • Amazon.co.jp: Kevin Costello: 本、バイオグラフィー、最新アップデート
  • Computational complexity of real functions - ScienceDirect

尋找相同分類的商品

暢銷商品排行榜

查看更多此分類商品

查看此商品的人也看了以下商品

附近賣場的商品

查看更多此分類商品

顧客評論

推薦度  4.7分

目前有 68則評論。