Share
On the Duality Feature of np Complete Problems and Their Opt-Solutions (in English)
Tian, Wenhong, Wenxia Guo Und Tingsong Ma: (Author)
·
Lap Lambert Academic Publishing
· Paperback
On the Duality Feature of np Complete Problems and Their Opt-Solutions (in English) - Tian, Wenhong, Wenxia Guo Und Tingsong Ma:
$ 56.29
$ 66.85
You save: $ 10.56
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Wednesday, July 31 and
Thursday, August 01.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "On the Duality Feature of np Complete Problems and Their Opt-Solutions (in English)"
NP Complete (abbreviated as NPC) problems, standing at the crux of deciding whether P=NP, are among hardest problems in computer science and other related areas. Observing that NPC problems have different natures, they can be further classified. We show that the classification of NPC problems may depend on their natures, reduction methods, exact algorithms, and the boundary between P and NP. We propose a new perspective: both P problems and NPC problems have the duality feature in terms of computational complexity of asymptotic efficiency of algorithms. We then introduce near optimal solutions to some NPC problems such as Traveling Salesman Problems (TSP), Boolean Satisfiability Problems (SAT), Scheduling algorithms in Cloud data centers and Bigdata process platforms. These solutions may shine light on other NPC problems and their applications.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
