Minecraft Adventures B2G1 Free
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Original Essays | August 28, 2015

    Sara Jaffe: IMG Summer Friction



    I was crying or almost crying for most of Fun Home: The Musical — I already loved Alison Bechdel's graphic novel, and I've always been a... Continue »
    1. $10.47 Sale Trade Paper add to wish list

      Dryland

      Sara Jaffe 9781941040133

    spacer
Qualifying orders ship free.
$163.50
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
4 Local Warehouse Mathematics- Logic and Philosophy

Computational Complexity

by

Computational Complexity Cover

 

Synopses & Reviews

Publisher Comments:

This new text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others.

Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability. Features

  • First unified introduction to computational complexity.
  • Integrates computation, applications, and logic throughout.
  • Provides an accessible introduction to logic, including Boolean logic, first-order logic, and second-order logic.
  • Includes extensive exercises including historical notes, references, and challeging problems.

0201530821B04062001

Synopsis:

This introduction to computational complexity integrates computation, applications and logic. The book considers logic, including boolean logic, first-order logic and second-order logic. It also includes extensive exercises and challenging problems.

Synopsis:

The first unified introduction and reference for the field of computational complexity. Virtually non-existent only 25 years ago, computational complexity has expanded tremendously and now comprises a major part of the researh activity in theoretical science.

Table of Contents

I. ALGORITHMS.
 1. Problems and Algorithms.

 2. Turing Machines.

 3. Undecidability.

II. LOGIC.

 1. Boolean Logic.

 2. First Order Logic.

 3. Undecidability in Logic.

III. P AND NP.

 1. Relations between Complexity Classes.

 2. Reductions and Completeness.

 3. NP-Complete Problems.

 4. coNP and Function Problems.

 5. Randomized Computation.

 6. Cryptography.

 7. Approximability.

 8. On P vs. NP.

IV. INSIDE P.

 1. Parallel Computation.

 2. Logarithmic Space.

V. BEYOND NP.

 1. The Polynomial Hierarchy.

 2. Computation That Counts.

 3. Polynomial Space.

 4. A Glimpse Beyond. 0201530821T04062001

Product Details

ISBN:
9780201530827
Author:
Papadimitriou, Christos
Author:
Papadimitriou, C. H.
Compiled:
Cram 101
Author:
Cram101 Textbook Reviews
Author:
Papadimitriou, 1st Edition
Author:
Cram101 Textbook Reviews, Textbook Revie
Author:
Cram 101
Publisher:
Pearson
Location:
Reading, Mass. :
Subject:
General
Subject:
Logic
Subject:
Programming - General
Subject:
Machine Theory
Subject:
Computational complexity
Subject:
Book Notes
Subject:
Computer Science
Subject:
Mathematics-Logic and Philosophy
Copyright:
Edition Description:
Trade paper
Series:
Cram101 Textbook Outlines
Series Volume:
9481
Publication Date:
November 1993
Binding:
TRADE PAPER
Grade Level:
College/higher education:
Language:
English
Illustrations:
Yes
Pages:
500
Dimensions:
9 x 6.3 x 1.2 in 794 gr

Other books you might like

  1. Combinatorial Optimization:... Used Trade Paper $12.00
  2. Ant Colony Optimization New Hardcover $58.50
  3. London Mathematical Society Lecture... New Trade Paper $67.25
  4. Universitext: Modern Geometry with... Used Trade Paper $49.00
  5. Introduction To Probability Models... Used Hardcover $15.50
  6. Graduate Texts in Mathematics #180:... New Hardcover $108.50

Related Subjects

Computers and Internet » Artificial Intelligence » General
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Programming and Languages
History and Social Science » Military » Aviation History
Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Foundations and Logic
Science and Mathematics » Mathematics » General
Science and Mathematics » Mathematics » Logic and Philosophy

Computational Complexity New Trade Paper
0 stars - 0 reviews
$163.50 In Stock
Product details 500 pages Addison Wesley Longman - English 9780201530827 Reviews:
"Synopsis" by , This introduction to computational complexity integrates computation, applications and logic. The book considers logic, including boolean logic, first-order logic and second-order logic. It also includes extensive exercises and challenging problems.
"Synopsis" by , The first unified introduction and reference for the field of computational complexity. Virtually non-existent only 25 years ago, computational complexity has expanded tremendously and now comprises a major part of the researh activity in theoretical science.
spacer
spacer
  • back to top

FOLLOW US ON...

       
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.