東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Algorithms." ]

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Foundations of algorithms /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Foundations of algorithms // Richard Neapoltian, Kumarss Naimipour.
作者:	Neapolitan, Richard E.
其他作者:	Naimipour, Kumarss.
出版者:	Sudbury, Mass. :Jones and Bartlett Publishers, : c2011.,
面頁冊數:	xv, 627 p. :ill. (some col.) ;24 cm.
附註:	Rev. ed. of: Foundations of algorithms using C pseudocode. 3rd ed. c2004.
標題:	Algorithms. -
ISBN:	9780763782504 (hbk.) :

Foundations of algorithms /
Neapolitan, Richard E.

Foundations of algorithms /Richard Neapoltian, Kumarss Naimipour. - 4th ed. - Sudbury, Mass. :Jones and Bartlett Publishers,c2011. - xv, 627 p. :ill. (some col.) ;24 cm.

Rev. ed. of: Foundations of algorithms using C pseudocode. 3rd ed. c2004.

Includes bibliographical references (p. [609]-613) and index.

Algorithms: efficiency, analysis, and order --

ISBN: 9780763782504 (hbk.) :US171.95

LCCN: 2009040309Subjects--Topical Terms:

536374
Algorithms.

LC Class. No.: QA9.58 / .N43 2011

Dewey Class. No.: 518/.1

Foundations of algorithms /
LDR:01328cam a2200205 a 4500 001 1331509
008 130221s2011 maua b 001 0 eng
010 $a 2009040309
020 $a 9780763782504 (hbk.) : $c US171.95
020 $a 0763782505 (hbk.)
035 $a LIB-BW-102-005
040 $a DLC $c DLC $d CIP $d YDXCP $d CDX
050 0 0 $a QA9.58 $b .N43 2011
082 0 0 $a 518/.1 $2 22
100 1 $a Neapolitan, Richard E. $3 765724
245 1 0 $a Foundations of algorithms / $c Richard Neapoltian, Kumarss Naimipour.
250 $a 4th ed.
260 # $a Sudbury, Mass. : $b Jones and Bartlett Publishers, $c c2011.
300 $a xv, 627 p. : $b ill. (some col.) ; $c 24 cm.
500 $a Rev. ed. of: Foundations of algorithms using C pseudocode. 3rd ed. c2004.
504 $a Includes bibliographical references (p. [609]-613) and index.
505 0 # $t Algorithms: efficiency, analysis, and order -- $t Divide-and- conquer -- $t Dynamic programming -- $t The greedy approach -- $t Backtracking -- $t Branch-and-bound -- $t Introduction to computational complexity : the sorting problem -- $t More computational complexity : the searching problem -- $t Computational complexity and intractability : an introduction to the theory of NP -- $t Number-theoretic algorithms -- $t Introduction to parallel algorithms -- $t Review of necessary mathematicd -- $t Solving referrence equations : with applications to analysis of recursive algorithms -- $t Data structures fo9r disjoint sets.
650 # 0 $a Algorithms. $3 536374
650 # 0 $a Constructive mathematics. $3 560970
650 # 0 $a Computational complexity. $3 523870
700 1 # $a Naimipour, Kumarss. $3 765723
700 1 # $a Neapolitan, Richard E. $3 765724