for algorithms can be considered a positive (although de nitely not a novel) feature. A consequent coupling of algorithm presentation with its analysis is also a very good thing. However, a better thing would be if an algorithm was not only analysed afterwards, but if complexity considerations were used beforehand to motivate the design of it (remember, the book s title is Algorithm design). In seeking the right amount of formality, the authors decided to work with abstract data types in an informal way. To some extent, this is a matter of taste. To some extent, this is a matter of consideration what can be gained by using e.g., the apparatus of axioms. For example, if analysis of algorithms was concerned also with their correctness, formal speci cations would probably play a bigger role. Among other positive features, extensive exercises in each chapter should be mentioned. They are of three kinds: reinforcement, creativity, and projects. Moreover, there are included several Java implementation examples in the book. The scope of topics included is another positive feature (again, it is de nitely a novel one). Text processing algorithms, network algorithms, some number theory and cryptography algorithms have been around in
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/review-of-theory-of-semi-feasible-algorithms-by-lane-hemaspaandra-and-8GeD82vH6I
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Review of Theory of semi-feasible algorithms by Lane Hemaspaandra and Leen Torenvliet. Springer.
Reviewer-Fortnow, Lance
Follow ACM SIGACT News
, Volume 35 (2)
Association for Computing Machinery – Jun 1, 2004
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
