# Franklin

### Staff View

LEADER 01055nam a22003013u 4500

001
9977535231403681

005
20151102011436.0

006
m d

007
cr -n---------

008
151102s2014||||||| s|||||||||||eng|d

035

a| (CKB)3710000000279052

035

a| (EBL)4036619

035

a| (CaSebORM)9781118594971

035

a| (EXLCZ)993710000000279052

040

a| AU-PeEL
b| eng
c| AU-PeEL
d| AU-PeEL

041

0

a| eng

082

0

0

a| 511.352

100

1

a| Du, Ding-Zhu.

245

1

0

a| Theory of Computational Complexity
h| [electronic resource].

250

a| 2nd ed.

260

a| :
b| Wiley,
c| 2014.

300

a| 1 online resource (611 p.)

336

a| text
b| txt
2| rdacontent

337

a| computer
b| c
2| rdamedia

338

a| online resource
b| cr
2| rdacarrier

347

a| text file

490

1

a| Wiley Series in Discrete Mathematics and Optimization

500

a| Description based upon print version of record.

520

a| Praise for the First Edition "...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." -Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition , examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additional exercises at varying levels of difficulty to further test comprehension of the presented material End-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition , is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.

650

4

a| Computational complexity.

655

4

a| Electronic books.

700

1

a| Ko, Ker-I.

776

z| 1-118-59497-5

830

0

a| Wiley Series in Discrete Mathematics and Optimization

906

a| BOOK