Computability and complexity theory
Resource Information
The work Computability and complexity theory represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Computability and complexity theory
Resource Information
The work Computability and complexity theory represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Computability and complexity theory
 Statement of responsibility
 Steven Homer, Alan L. Selman
 Subject

 Computational complexity
 Computer science
 Information theory
 Computer science
 Computational complexity
 Computer science
 Algorithm Analysis and Problem Complexity
 Computer science
 Information theory
 Information theory
 Computational complexity
 Computer software
 Computational complexity
 Electronic resources
 Computer science
 Information theory
 Computational complexity
 Computer science
 Computational complexity
 Informatique
 Information theory
 Information theory
 Computer science
 Information theory
 Theory of Computation
 Language
 eng
 Summary
 This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is selfcontained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NPcompleteness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton. a chapter studying properties of the fundamental probabilistic complexity classes a study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Toda a thorough treatment of the proof that IP is identical to PSPACE With its accessibility and welldevised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NPcompleteness, NPhardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner Provides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and selfstudy purposes
 Cataloging source
 GW5XE
 Image bit depth
 0
 LC call number
 QA76
 LC item number
 .H66 2011
 Literary form
 non fiction
 Nature of contents
 dictionaries
 Series statement
 Texts in Computer Science,
Context
Context of Computability and complexity theoryEmbed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/S7oGQIqS058/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/S7oGQIqS058/">Computability and complexity theory</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Computability and complexity theory
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/S7oGQIqS058/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/S7oGQIqS058/">Computability and complexity theory</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>