MARC 닫기
00614nam ac200217 k 4500
000003864731
20220101120000
ta
060221s2006 us 000 eng
▼a 0321295358:
▼c US$87.60
▼a 211070
▼c 211070
▼l WM0000007396
▼a QA76.9.A43
▼a QA76.9.A43
▼b K54
▼a Kleinberg,Jon
▼a Algorithm Design/
▼d Kleinberg,Jon;
▼e Tardos,Eva
▼a Boston:
▼b Addison Wesley,
▼c 2006.
▼a 838p.;
▼c 24cm.
▼a ALGORITHM
▼a DESIGN
▼a Computer algorithms
▼a Data structures
▼a Computer sicence
▼a Tardos,Eva
▼b US$87.60
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| ISBN : | 0321295358: |
| 분류기호 : | QA76.9.A43 |
| 개인저자 : | Kleinberg,Jon |
| 서명/저자사항 : | Algorithm Design/ Kleinberg,Jon; Tardos,Eva |
| 발행사항 : | Boston: Addison Wesley, 2006. |
| 형태사항 : | 838p.; 24cm. |
| 개인저자 : | Tardos,Eva |
| 언어 | 영어 |
권 호 :
발행년 : 2006
발행처 : Addison Wesley
서 명 : Algorithm Design
목차
Introduction : Some Representative Problems
Basics of Algorithms Analysis
Graphs
Greedy Algorithms
Divide and Conquer
Dynamic Programming
Network Flow
NP and Computational Intractability
PSPACE : A Class of Problems beyond NP
Extending the Limits of Tractability
Approximation Algorithms
Local Search
Randomized Algorithms
서평쓰기