containing a good deal of pure mathematics. Additionally, it would be useful to have read a general introductory textbook on computer algebra, such as [2] for example, before reading this book. A passing appreciation with the problems involved in computing on the other hand is quite su cient. Examples, are fairly plentiful, and usually very helpful, with a good level of detail in the working. There are only a few exercises throughout, although this is not a criticism as such; perhaps in a future edition this issue could be addressed, if the readership is be extended to say, graduate students. In this regard sample solutions would be useful in helping the reader check their grasp of the more technical side of the material. References [1] Du-Bois Reymond, P. Ueber asymptotische Werthe, in nitaere Approximationen und in nitaere Au osung von Gleichungen. (1875) [2] Davenport, J.H., Siret, Y. and Tournier, E. Computer Algebra Harcourt Brace Jovanovich (1988) [3] Richardson, D. Some Undecidable Problems Involving Elementary Functions of a Real Variable. J. Symbolic Logic (1968), 33:514 520 [4] Richardson, D. How to Recognize Zero. In Journal of Symbolic Computation (1994), 24(6), 627 646. [5] Shackell, J.R. Symbolic asymptotics: Functions of
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/review-of-complexity-and-cryptography-an-introduction-by-john-talbot-YUBwXbx4S2
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Review of Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh, Cambridge University Press, 2006, 292 pages
Rothe, Jörg
Follow ACM SIGACT News
, Volume 38 (2)
Association for Computing Machinery – Jun 1, 2007
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
