The Resource Computability and complexity theory, Steven Homer, Alan L. Selman
Computability and complexity theory, Steven Homer, Alan L. Selman
Resource Information
The item Computability and complexity theory, Steven Homer, Alan L. Selman represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Computability and complexity theory, Steven Homer, Alan L. Selman represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 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 KarpLipton. 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
 Language
 eng
 Edition
 2nd ed.
 Extent
 1 online resource (xvi, 298 pages)
 Contents

 1. Preliminaries
 2. Introduction to computability
 3. Undecidability
 4. Introduction to complexity theory
 5. Basic results of complexity theory
 6. Nondeterminism and NPcompleteness
 7. Relative computability
 8. Nonuniform complexity
 9. Parallelism
 10. Probabilistic complexity classes
 11. Introduction to counting classes
 12. Interactive proof systems
 Isbn
 9781461406822
 Label
 Computability and complexity theory
 Title
 Computability and complexity theory
 Statement of responsibility
 Steven Homer, Alan L. Selman
 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 KarpLipton. 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
 http://library.link/vocab/creatorName
 Homer, S.
 Dewey number
 004
 Illustrations
 illustrations
 Index
 index present
 Language note
 English
 LC call number
 QA76
 LC item number
 .H66 2011
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName
 Selman, Alan L
 Series statement
 Texts in computer science,
 http://library.link/vocab/subjectName

 Computer science
 Information theory
 Computational complexity
 Informatique
 Computational complexity
 Computer science
 Information theory
 Label
 Computability and complexity theory, Steven Homer, Alan L. Selman
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references (pages 283288) and indexes
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 1. Preliminaries  2. Introduction to computability  3. Undecidability  4. Introduction to complexity theory  5. Basic results of complexity theory  6. Nondeterminism and NPcompleteness  7. Relative computability  8. Nonuniform complexity  9. Parallelism  10. Probabilistic complexity classes  11. Introduction to counting classes  12. Interactive proof systems
 Control code
 769643967
 Dimensions
 unknown
 Edition
 2nd ed.
 Extent
 1 online resource (xvi, 298 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9781461406822
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number

 10.1007/9781461406822
 10.1007/978146140
 Other physical details
 illustrations.
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)769643967
 Label
 Computability and complexity theory, Steven Homer, Alan L. Selman
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references (pages 283288) and indexes
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 1. Preliminaries  2. Introduction to computability  3. Undecidability  4. Introduction to complexity theory  5. Basic results of complexity theory  6. Nondeterminism and NPcompleteness  7. Relative computability  8. Nonuniform complexity  9. Parallelism  10. Probabilistic complexity classes  11. Introduction to counting classes  12. Interactive proof systems
 Control code
 769643967
 Dimensions
 unknown
 Edition
 2nd ed.
 Extent
 1 online resource (xvi, 298 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9781461406822
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number

 10.1007/9781461406822
 10.1007/978146140
 Other physical details
 illustrations.
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)769643967
Library Links
Embed
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.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/JKlBdimL2nA/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/JKlBdimL2nA/">Computability and complexity theory, Steven Homer, Alan L. Selman</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri 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 Item Computability and complexity theory, Steven Homer, Alan L. Selman
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.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/JKlBdimL2nA/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/JKlBdimL2nA/">Computability and complexity theory, Steven Homer, Alan L. Selman</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>