Physics – Quantum Physics
Scientific paper
2000-10-05
Physics
Quantum Physics
12 pages, 3 figures, submitted to Congress on Evolutionary Computation 2001
Scientific paper
There is no known polynomial-time algorithm that can solve an NP problem. Evolutionary search has been shown to be a viable method of finding acceptable solutions within a reasonable time period. Recently quantum computers have surfaced as another alternative method. But these two methods use radically different philosophies for solving NP problems even though both search methods are non-deterministic. This paper uses instances of {\bf SAT}, {\bf 3SAT} and {\bf TSP} to describe how these two methods differ in their approach to solving NP problems.
No associations
LandOfFree
Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms 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 Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-494044