NP-Complete : Computational Complexity Theory, Complexity Class, Polynomial Time, Unsolved Problems in Computer Science, Approximation Algorithm, Subset

Language: English

Published by Omniscriptum, 2010

6130333285 / 9786130333287

  • Softcover
  • New
See all details

Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

5-star seller

AbeBooks seller since August 14, 2006

Softcover

Condition: New

£ 33.29

£ 29.89 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC), is a class of problems having two properties: Any given solution to the problem can be verified quickly (in polynomial time); the set of problems with this property is called NP (nondeterministic polynomial time). If the problem can be solved quickly (in polynomial time), then so can every problem in NP. Although any given solution to such a problem can be verified quickly, there is no known efficient way to locate a solution in the first place; indeed, the most notable characteristic of NP-complete problems is that no fast solution to them is known. That is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows. As a result, the time required to solve even moderately large versions of many of these problems easily reaches into the billions or trillions of years, using any amount of computing power available today. As a consequence, determining whether or not it is possible to solve these problems quickly is one of the principal unsolved problems in computer science today.…

Seller Inventory # 9786130333287

Title
NP-Complete : Computational Complexity Theory, Complexity Class, Polynomial Time, Unsolved Problems in Computer Science, Approximation Algorithm, Subset
Author
Lambert M. Surhone
Publisher
Omniscriptum
Publication year
2010
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
6130333285
ISBN 13
9786130333287
Item weight
143 grams
Dimensions
220x150x6 mm

AHA-BUCH GmbH

Einbeck, Germany

5-star seller

AbeBooks seller since August 14, 2006

Shipping rates from Germany to U.S.A.

Item7 to 10 business days5 to 7 business days
First item£ 29.89£ 38.43
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Bank Wire Transfer
  • Check
  • Paypal

Store description

Das Unternehmen AHA-BUCH GmbH: Seit der Gründung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisgünstig wie möglich ihren Bücherwunsch zu erfüllen. Unsere Firma beschäftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine Wünsche! Auf über 3700 m2 Fläche haben wir über 100.000 Bücher, Modernes Antiquariat und Spiele auf Lager.

Specialty

Kinderbücher & Kinderhör Casetten, German Books, Software, Natur & Tiere, Ratgeber, Sachbücher, Englische Bücher, Medizin & Gesundheit, Universität & Studium

Seller's business information

AHA-BUCH GmbH

Garlebsen 48
Einbeck, Germany 37574