因為我自己也想要了解THEORY OF COMPUTATIONAL COMPLEXITY 2/E,所以到處尋找資訊做功課.要到處比價;尋找低價及可靠的網購地方!THEORY OF COMPUTATIONAL COMPLEXITY 2/E數量有限,售完為止!限量是殘酷的,不要猶豫入手要快~SARAH最近也對這個商品很感興趣,最近有些網友在問THEORY OF COMPUTATIONAL COMPLEXITY 2/E要去哪裡買最便宜呢?
詳細資料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.