ACM Home Page
Please provide us with feedback. Feedback
Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages
Full text PdfPdf (154 KB)
Source
ACM SIGACT News archive
Volume 38 ,  Issue 2  (June 2007) table of contents
REVIEWS: Book reviews table of contents
Pages: 16 - 20  
Year of Publication: 2007
ISSN:0163-5700
Author
Jörg Rothe  Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 45,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1272729.1272735
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
{HO02} L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
 
3
{May04} A. May. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In Advances in Cryptology --- CRYPTO '04, pages 213--219. Springer-Verlag Lecture Notes in Computer Science #3152, 2004.
 
4
{Pap94} C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
 
5
 
6
 
7