書 正版 The Computational Complexity of Equivalence and Isomorp的詳細資訊
書籍為正版書籍 ,部分絕版書籍,為舊書或者二手書籍,建議咨詢客服
1.書籍均為簡體正版書籍,大陸版社直接寄送。部分絕版書籍為二手二手書籍
2.貨物3天內安排寄送,到貨時間大概8~12天,有時間要求請及時聯繫。
3.圖書因物流運送且多為單冊包裝,偶有碰撞折損潮損,非無法閱讀均不可退貨,完美要求者請切勿下標。
4.大物件商品超過超區規格,需要下標宅配到付哦 。
5.可免費代尋書籍!店鋪每天上新歡迎關注!
6.收到商品有任何問題,歡迎咨詢,感謝~
開 本:20開
紙 張:輕型紙
包 裝:平裝-膠訂
是否套裝:否
國際標準書號ISBN:9783540410324
所屬分類:圖書>英文原版書>科學與技術 Science & Techology
The Computational Complexity of Equivalence and Isomorphism Problems
作者: Thierauf, Thomas
出版社: Springer
頁數: 135頁
語種: 英語
ISBN: 9783540410324
條形碼: 9783540410324
商品重量: 220.00g
商品尺寸: 23.39cm * 15.60cm * 0.81cm
編輯推薦
A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model.
The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered.商品備註・物品狀況:全新・最新關注時間:2025-08-06