Authors: Neapolitan, Richard E. Naimipour, Kumarss
Pages: 500
Publisher: Unknow
ISBN13: 9780763723873
This book offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity that is accessible to mainstream computer science students who have a background in college algebra and discrete structures.