Theory of Computational Complexity

Description

Praise for the First Edition "...complete, up-to-date coverage of computational complexitytheory...the book promises to become the standard reference oncomputational complexity." -Zentralblatt MATH A thorough revision based on advances in the field ofcomputational complexity and readers’ feedback, the SecondEdition of Theory of Computational Complexity presentsupdates to the principles and applications essential tounderstanding modern computational complexity theory. The newedition continues to serve as a comprehensive resource on the useof software and computational approaches for solving algorithmicproblems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory ofComputational Complexity, Second Edition, examines the theoryand methods behind complexity theory, such as computational models,decision tree complexity, circuit complexity, and probabilisticcomplexity. The Second Edition also features recentdevelopments on areas such as NP-completeness theory, as wellas: A new combinatorial proof of the PCP theorem based on thenotion of expander graphs, a research area in the field of computerscience Additional exercises at varying levels of difficulty to furthertest comprehension of the presented material End-of-chapter literature reviews that summarize each topic andoffer additional sources for further study Theory of Computational Complexity, Second Edition, is anexcellent textbook for courses on computational theory andcomplexity at the graduate level. The book is also a usefulreference for practitioners in the fields of computer science,engineering, and mathematics who utilize state-of-the-art softwareand computational methods to conduct research. Athorough revision based on advances in the field of computationalcomplexity and readers’feedback,the Second Edition of Theory of Computational Complexity presentsupdates to theprinciplesand applications essential to understanding modern computationalcomplexitytheory.The new edition continues to serve as a comprehensive resource onthe use of softwareandcomputational approaches for solving algorithmic problems and therelated difficulties thatcanbe encountered.Maintainingextensive and detailed coverage, Theory of ComputationalComplexity, SecondEdition,examines the theory and methods behind complexity theory, such ascomputationalmodels,decision tree complexity, circuit complexity, and probabilisticcomplexity. The SecondEditionalso features recent developments on areas such as NP-completenesstheory, as well as:•A new combinatorial proof of the PCP theorem based on the notion ofexpandergraphs,a research area in the field of computer science•Additional exercises at varying levels of difficulty to furthertest comprehension ofthepresented material•End-of-chapter literature reviews that summarize each topic andoffer additionalsourcesfor further studyTheoryof Computational Complexity, Second Edition, is an excellenttextbook for courses oncomputationaltheory and complexity at the graduate level. The book is also auseful referenceforpractitioners in the fields of computer science, engineering, andmathematics who utilizestate-of-the-artsoftware and computational methods to conduct research.

Get the book

Amazon.com

Search the book

eBay.com

Search the book

Other editions

• 

  Theory of Computational Complexity

  • 2011-10-24
  • 511 pages
  • Paperback
  • John Wiley & Sons

Similar books

• 

  Integral Geometry and Tomography: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Held June 24-30, 1989, with Support from the...

  By Eric Grinberg, Eric Todd Quinto

  In Section 2 we will deal with the “discrete” case. Let S be a locally finite tree T endowed with the natural integer-valued distance function: the ...

• 

  Ordinary Differential Equations and Linear Algebra: A Systems Approach

  By Todd Kapitula

  ... for in this case [yp](s)=s[yp](s), [yp](s)=s2[yp](s). As we will see in the examples, this assumption also makes it possible to deal with the initial ...

• 

  Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis

  By Iris van Rooij, Mark Blokpoel, Johan Kwisthout

  x,y∈S δ(x,y) is maximum. u(x) + ADDITIVE SUBSET CHOICE Input: A set X = {x1 ,x2 ... F Tractability cycle Test 8.2 How (Not) to Deal with Intractability 173.

• 

  Mymathlab -- Standalone Access Card

  By Pearson Education, David P Pearson Education, Hall H Pearson Education

  Several versions of Pearson's MyLab & Mastering products exist for each title, including customized versions for individual schools, and registrations are not transferable.

• 

  Mymathlab Student Acc Kit + Intro Alg Wrkshts

  By Inc. Pearson Education

  Mymathlab Student Acc Kit + Intro Alg Wrkshts

• 

  Pearson Mathematics 7: H.P

  By Pearson Education Australia Staff

  Pearson Mathematics homework program for Year 7 provides tear-out sheets which correspond with student book sections, providing systematic and cumulative skills revision of basic skills and current class topics in the form of take-home ...

• 

  Worksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models

  By Addison-Wesley

  Worksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models

• 

  Pearson Mathematics New South Wales 8 Student Book: Australian Curriculum

  By Pearson Education Australia Staff, Gael McLeod, David Coffey

  The Student Book provides an easy-to-use 'nuts and bolts' book at each year level.

• 

  Matrix Iterative Analysis

  By Richard S. Varga

  ... partial differential equations have received a great deal of attention. For excellent bibliographical coverage, see Todd (1956), Richtmyer (1957), ...

• 

  Mathematical Modelling: Education, Engineering and Economics - ICTMA 12

  By C Haines, P Galbraith, W Blum

  Todd, P. A., McKeen, .l. ... ANALYTICAL SUPPORT PROBLEM SOLVING Cognitive Perspectives on Modelling HOW DO STUDENTS AND TEACHERS DEAL Sodhi and Son 219 NOTE ...