Review of: Computability and Complexity Theory 4 by Authors: Steven Homer and Alan L. Selman Publisher: Springer Review of: The Complexity Theory Companion by Authors: Lane A. Hemaspaandra and Mitsunori Ogihara Publisher: Springer Reviewed by E W Cenek, University of Waterloo Overview The study of computability and complexity theory lies at the root of computing science, as computer scientists try to address the dual questions of which problems are in fact solvable, and how much effort should we expect to expend to solve a given problem. Problems are grouped together in classes on the basis of these questions. Thus P is the class of problems that can be solved in polynomial time, while NP is the class of problems that can be accepted in polynomial time using a non-deterministic Taring Machine. NP-complete problems were first studied in the sixties and early seventies. 2.1 S u m m a r y of Contents Computability and Complexity Theory Homer and Selman's "Computability and Complexity Theory" is clearly intended as an introductory text. The book is reasonably self-contained, and tightly focused on its topic. The book can loosely be divided into three parts; the first and shortest comprises the Preliminaries; a
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/computability-and-complexity-theory-and-the-complexity-theory-QaizvI5Ic0
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Computability and complexity theory and the complexity theory companion
Čenek, E. W.
Follow ACM SIGACT News
, Volume 33 (3)
Association for Computing Machinery – Sep 1, 2002
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
