Placeholder text

Go to cart

On the Duality Feature of NP Complete Problems and Their Opt-Solutions

By Wenhong Tian

On the Duality Feature of NP Complete Problems and Their Opt-Solutions

By Wenhong Tian

0 - Default Title
Description
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.
Product details
Binding:
Paperback
Number of Pages:
132
Release Date:
2025-10-17
Publication Date:
2025-10-17
Publisher:
LAP LAMBERT Academic Publishing
Languages:
Original: English
ISBN10:
6208884780
ISBN13:
9786208884789
Weight:
215 g
Height:
150 cm
Width:
220 cm
Thickness:
8 cm
Buy on Amazon
Currently sold out