Lecture Notes on Algorithm Analysis and Computational Complexity, 4/E.

Ian Parberry

Informasi Dasar

47 kali
23.21.1128
518.1
Buku - Elektronik (E-Book)
10b

These lecture notes are almost exact copies of the overhead projector transparencies used by the author in his course of Algorithm Analysis and Complexity Theory at the University of North Texas. The material comes from: - textbooks on algorithm design and analysis, - textbooks on other subjects, - research monographs, - papers in research journals and conference.

Since this is not a textbook, readers probably already aware that to get the best use of this note they need to attend the course itself. Not to worry though, the note itself is readable, neatly summarized and contains 219 sophisticated graphics. It makes a good reference.

Then again, readers are expected to able to program in some procedural programming language such as C or C++, and to be able to deal with discrete mathematics. Some familiarity with basic data structures and algorithm analysis techniques is also assumed.

Subjek

ALGORITHMS
COMPUTATIONAL COMPLEXITY,

Katalog

Lecture Notes on Algorithm Analysis and Computational Complexity, 4/E.
-
118p.: pdf file.; 2 MB
English

Sirkulasi

Rp. 0
Rp. 0
Tidak

Pengarang

Ian Parberry
Perorangan
 
 

Penerbit

Wiley
New York
2001

Koleksi

Kompetensi

 

Download / Flippingbook

 

Ulasan

Belum ada ulasan yang diberikan
anda harus sign-in untuk memberikan ulasan ke katalog ini