Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition)

Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition)

Tranparency materials used in Algorithm Analysis and Complexity Theory course at the University of North Texas.

Publication date: 30 Nov -0001

ISBN-10: n/a

ISBN-13: n/a

Paperback: n/a

Views: 33,736

Type: N/A

Publisher: n/a

License: n/a

Post time: 22 Feb 2005 10:07:55

Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition)

Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition) Tranparency materials used in Algorithm Analysis and Complexity Theory course at the University of North Texas.
Tag(s): Theory of Computation
Publication date: 30 Nov -0001
ISBN-10: n/a
ISBN-13: n/a
Paperback: n/a
Views: 33,736
Document Type: N/A
Publisher: n/a
License: n/a
Post time: 22 Feb 2005 10:07:55
Terms and Conditions :
Ian Parberry wrote:- No part of this work may be made available on a public forum (including, but not limited to a web page, ftp site, bulletin board, or internet news group) without the written permission of the author.
- No part of this work may be rented, leased, or offered for sale commercially in any form or by any means, either print, electronic, or otherwise, without written permission of the author.

 

Book excerpts:

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.
 




About The Author(s)


No information is available for this author.

Ian Parberry

No information is available for this author.


Book Categories
Sponsors
Icons8, a free icon pack