Search

Categories

    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss

Filter By Price

$
-
$

Dietary Needs

Top Rated Product

product-img product-img

Modern Chair

$165.00
product-img product-img

Plastic Chair

$165.00
product-img product-img

Design Rooms

$165.00

Brands

  • Wooden
  • Chair
  • Modern
  • Fabric
  • Shoulder
  • Winter
  • Accessories
  • Dress

Welcome and thank you for visiting us. For any query call us on 0799 626 359 or Email [email protected]

Offcanvas Menu Open

Shopping Cart

Africa largest book store

Sub Total:

Search for any Title

P, NP, and NP-Completeness : The Basics of Computational Complexity

By: Oded Goldreich (Author)

Manufacture on Demand

Ksh 10,650.00

Format: Paperback or Softback

ISBN-10: 0521122546

ISBN-13: 9780521122542

Publisher: Cambridge University Press

Imprint: Cambridge University Press

Country of Manufacture: GB

Country of Publication: GB

Publication Date: Aug 16th, 2010

Publication Status: Active

Product extent: 216 Pages

Weight: 336.00 grams

Dimensions (height x width x thickness): 22.80 x 15.60 x 1.30 cms

Product Classification / Subject(s): Mathematical theory of computation

Choose your Location

Shipping & Delivery

Door Delivery

Delivery fee

Delivery in 10 to 14 days

  • Description

  • Reviews

This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness.

Get P, NP, and NP-Completeness by at the best price and quality guranteed only at Werezi Africa largest book ecommerce store. The book was published by Cambridge University Press and it has pages. Enjoy Shopping Best Offers & Deals on books Online from Werezi - Receive at your doorstep - Fast Delivery - Secure mode of Payment

Customer Reviews

Based on 0 reviews

Mind, Body, & Spirit