Full Product Details
Author: Edna E. Reiter ,
Clayton Matthew Johnson
Publisher: Taylor & Francis Inc
Imprint: Chapman & Hall/CRC
Dimensions:
Width: 15.60cm
, Height: 2.30cm
, Length: 23.40cm
Weight: 1.300kg
ISBN: 9781439882061
ISBN 10: 1439882061
Pages: 279
Publication Date: 29 October 2012
Audience:
Professional and scholarly
,
College/higher education
,
Professional & Vocational
,
Tertiary & Higher Education
Format: Hardback
Publisher's Status: Active
Availability: In Print
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.
Reviews
... a very basic, reader friendly introduction to computational complexity theory. What sets their book apart from others on the topic is its leisurely pace. ... Because the book is so readable, it is likely that its primary audience will include students who experienced difficulties with other books on the topic. However, those students would probably benefit from more exercises than this volume provides, especially full solutions, at least for some exercises. ... Highly recommended. Lower-division undergraduates. -M Bona, University of Florida in CHOICE Magazing, June 2013
... a very basic, reader friendly introduction to computational complexity theory. What sets their book apart from others on the topic is its leisurely pace. ... Because the book is so readable, it is likely that its primary audience will include students who experienced difficulties with other books on the topic. However, those students would probably benefit from more exercises than this volume provides, especially full solutions, at least for some exercises. ... Highly recommended. Lower-division undergraduates. -M Bona, University of Florida in CHOICE Magazine, June 2013 This excellent book on DSNs has a wealth of information for researchers, engineers, and scientists. It could be used as a textbook for graduate-level and doctoral courses on DSNs, and would also serve as a reference for engineers, scientists, and researchers working in this field. -Computing Reviews, April 2013
"""… a very basic, reader friendly introduction to computational complexity theory. What sets their book apart from others on the topic is its leisurely pace. … Because the book is so readable, it is likely that its primary audience will include students who experienced difficulties with other books on the topic. However, those students would probably benefit from more exercises than this volume provides, especially full solutions, at least for some exercises. … Highly recommended. Lower-division undergraduates. —M Bona, University of Florida in CHOICE Magazine, June 2013 ""This excellent book on DSNs has a wealth of information for researchers, engineers, and scientists. It could be used as a textbook for graduate-level and doctoral courses on DSNs, and would also serve as a reference for engineers, scientists, and researchers working in this field."" —Computing Reviews, April 2013"
Author Information
Edna E. Reiter, Ph.D., is the current Chair of the Department of Mathematics and Computer Science at California State University, East Bay (CSUEB). Her research interests include noncommutative ring theory and theoretical aspects of computer science. Clayton Matthew Johnson, Ph.D., is the graduate coordinator for all M.S. students and the incoming Chair of the Department of Mathematics and Computer Science at CSUEB. His research interests include genetic algorithms and machine learning. Drs. Reiter and Johnson developed the subject matter for the CSUEB Computation and Complexity course, which is required for all students in the computer science M.S. program. The course covers the hard problems of computer science—those that are intractable or undecidable. The material in this book has been tested on multiple sections of CSUEB students.
