THEORY OF COMPUTATIONAL COMPLEXITY 2/E數量有限,售完為止！限量是殘酷的,入手要快~最近有些網友在問THEORY OF COMPUTATIONAL COMPLEXITY 2/E哪裡買最便宜?我有去遍尋各大購物網站yahoo奇摩購物、momo購物、博客來、PChome、7Net搜尋優惠價格!下面就是更進一步圖片文字資訊的介紹！點擊圖片或文字可以進到詳細購物推薦網站~一直以來我都很相信LENA推荐的東西。超多的鄉民很都說THEORY OF COMPUTATIONAL COMPLEXITY 2/E無敵強的！LENA也嘗試強烈推荐,並介紹我該商品優缺點。雅虎購物、momo購物及博客來是我比較常去逛的網購平台,常常有優惠商品可撿。實際到販售的購物網去看,價格就有機會再便宜一些!LENA最近也對這個商品很趕興趣, |
 |
售價:1640  |
詳細資料ISBN：9781118306086 叢書系列：實用資訊 規格：精裝 / 512頁 / 普通級/ 單色印刷 / 初版 出版地：台灣 內容簡介 PRAISE FOR THE FIRST EDITION"...COMPLETE, UP-TO-DATE COVERAGE OF COMPUTATIONAL COMPLEXITY THEORY...THE BOOK PROMISES TO BECOME THE STANDARD REFERENCE ON COMPUTATIONAL COMPLEXITY." -ZENTRALBLATT MATHA THOROUGH REVISION BASED ON ADVANCES IN THE FIELD OF COMPUTATIONAL COMPLEXITY AND READERS’ FEEDBACK, THE SECOND EDITION OF THEORY OF COMPUTATIONAL COMPLEXITY PRESENTS UPDATES TO THE PRINCIPLES AND APPLICATIONS ESSENTIAL TO UNDERSTANDING MODERN COMPUTATIONAL COMPLEXITY THEORY. THE NEW EDITION CONTINUES TO SERVE AS A COMPREHENSIVE RESOURCE ON THE USE OF SOFTWARE AND COMPUTATIONAL APPROACHES FOR SOLVING ALGORITHMIC PROBLEMS AND THE RELATED DIFFICULTIES THAT CAN BE ENCOUNTERED.MAINTAINING EXTENSIVE AND DETAILED COVERAGE, THEORY OF COMPUTATIONAL COMPLEXITY, SECOND EDITION, EXAMINES THE THEORY AND METHODS BEHIND COMPLEXITY THEORY, SUCH AS COMPUTATIONAL MODELS, DECISION TREE COMPLEXITY, CIRCUIT COMPLEXITY, AND PROBABILISTIC COMPLEXITY. THE SECOND EDITION ALSO FEATURES RECENT DEVELOPMENTS ON AREAS SUCH AS NP-COMPLETENESS THEORY, AS WELL AS: ●A NEW COMBINATORIAL PROOF OF THE PCP THEOREM BASED ON THE NOTION OF EXPANDER GRAPHS, A RESEARCH AREA IN THE FIELD OF COMPUTER SCIENCE ●ADDITIONAL EXERCISES AT VARYING LEVELS OF DIFFICULTY TO FURTHER TEST COMPREHENSION OF THE PRESENTED MATERIAL ●END-OF-CHAPTER LITERATURE REVIEWS THAT SUMMARIZE EACH TOPIC AND OFFER ADDITIONAL SOURCES FOR FURTHER STUDY THEORY OF COMPUTATIONAL COMPLEXITY, SECOND EDITION, IS AN EXCELLENT TEXTBOOK FOR COURSES ON COMPUTATIONAL THEORY AND COMPLEXITY AT THE GRADUATE LEVEL. THE BOOK IS ALSO A USEFUL REFERENCE FOR PRACTITIONERS IN THE FIELDS OF COMPUTER SCIENCE, ENGINEERING, AND MATHEMATICS WHO UTILIZE STATE-OF-THE-ART SOFTWARE AND COMPUTATIONAL METHODS TO CONDUCT RESEARCH. |
| 搜尋參考資料: 1. en.m.wikipedia.org/wiki/Computational_complexity_theory Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational ... en.wikipedia.org/wiki/Category:Computational_complexity_theory Pages in category "Computational complexity theory" The following 99 pages are in this category, out of 99 total. This list may not reflect recent changes . ... complexitytheory.de/index.htm Theory of Computation: Complexity ... Conference; Introduction A computational ... However the question of computability logically precedes that of complexity: ... Computational Complexity Theory ... Lecture notes for a graduate course on computational complexity taught at the University of Washington. www.wiley.com/WileyCDA/WileyTitle/productCd-0471345067.html Theory of Computational Complexity. Ding-Zhu Du, Ker-I Ko. ISBN: 978-0-471-34506-0. 512 pages. Purchase Options. Hardcover. Unavailable for purchase from this … THEORY OF COMPUTATIONAL COMPLEXITY 2,E |
#熱銷商品#
資料來源：博客來 |
留言列表
