滿額折
Computability and Complexity
商品資訊
ISBN13：9780262100649
出版社：Mit Pr
作者：Neil D. Jones
出版日：1997/01/23
裝訂／頁數：精裝／484頁
規格：24.1cm*18.4cm*3.8cm (高/寬/厚)
商品簡介
作者簡介
商品簡介
A computer science text bridging the gap between the perceived impenetrability of computability and complexity theory and practical programming problems. Jones (computer science, U. of Copenhagen) offers new results, including a proof that constant time factors do matter for its programming-oriented model of computation, and other results regarding characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, as well as a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs. Annotation c. by Book News, Inc., Portland, Or.
作者簡介
Neil D. Jones is Professor of Computer Science at the University of Copenhagen.
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。