Dimensionality Decrease Heuristics for NP Complete Problems

Details Dimensionality Decrease Heuristics for NP Complete Problems Dimensionality Decrease Heuristics for NP Complete Problems

2011-04-11

arxiv.org/abs/1104.1822v1

Computer Science

Data Structures and Algorithms

Scientific paper

The vast majority of scientific community believes that P!=NP, with countless supporting arguments. The number of people who believe otherwise probably amounts to as few as those opposing the 2nd Law of Thermodynamics. But isn't nature elegant enough, not to resource to brute-force search? In this article, a novel concept of dimensionality is presented, which may lead to a more efficient class of heuristic implementations to solve NP complete problems. Thus, broadening the universe of man-machine tractable problems. Dimensionality, as defined here, will be a closer analog of strain energy in nature.

Affiliated with

Also associated with

No associations

Rating

Dimensionality Decrease Heuristics for NP Complete Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dimensionality Decrease Heuristics for NP Complete Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dimensionality Decrease Heuristics for NP Complete Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57980