000 04093nam a22005055i 4500
001 978-1-4614-0682-2
003 DE-He213
005 20140220083733.0
007 cr nn 008mamaa
008 111209s2011 xxu| s |||| 0|eng d
020 _a9781461406822
_9978-1-4614-0682-2
024 7 _a10.1007/978-1-4614-0682-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aHomer, Steven.
_eauthor.
245 1 0 _aComputability and Complexity Theory
_h[electronic resource] /
_cby Steven Homer, Alan L. Selman.
250 _a2.
264 1 _aBoston, MA :
_bSpringer US :
_bImprint: Springer,
_c2011.
300 _aXVI, 298p. 50 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTexts in Computer Science,
_x1868-0941
505 0 _aPreliminaries -- Introduction to Computability -- Undecidability -- Introduction to Complexity Theory -- Basic Results of Complexity Theory -- Nondeterminism and NP-Completeness -- Relative Computability -- Nonuniform Complexity -- Parallelism -- Probabilistic Complexity Classes -- Introduction to Counting Classes -- Interactive Proof Systems -- References -- Author Index -- Subject Index.
520 _aThis 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 self-contained, 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, NP-completeness, 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 well-devised 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 NP-completeness, NP-hardness, 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 self-study purposes
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aSelman, Alan L.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461406815
830 0 _aTexts in Computer Science,
_x1868-0941
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-0682-2
912 _aZDB-2-SCS
999 _c106266
_d106266