first part covers those complexity topics that one expects to see in any computational complexity textbook. Parts II and III are reasonably independent from one another, as seems only reasonable given the scope of the two parts. The problems at the end of each chapter are interesting, and serve to extend the material. I enjoyed reading the book; each section flowed into the next, and there was an overarching organization that made it easier to follow the material. There were a few minor typos that I detected, but those were obvious from context. Program-size, or Kolmogorov, complexity is not discussed in the book, which is a pity since Kolmogorov complexity would have produced an interesting unified view of nonunifom models, but is understandable considering the scope of the topic. C o m p u t e r A r i t h m e t i c Algorithms by Israel Koren P u b l i s h e d by A.K. Peters 296 pages~ $49.00 Reviewer: George A. Constantinides (george.constantinides@ieee.org) 4 Introduction This book covers the broad topic of implementing arithmetic in digital logic and/or in software. With the increasing acceptance of custom hardware designs for arithmetic
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-computer-arithmetic-algorithms-by-israel-koren-a-k-peters-33KGZOFAA7
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Review of Computer arithmetic algorithms by Israel Koren. A.K. Peters.
Reviewer-Constantinides, George A.
Follow ACM SIGACT News
, Volume 34 (3)
Association for Computing Machinery – Sep 1, 2003
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
