The computational complexity of Kauffman nets and the P versus NP problem

Details The computational complexity of Kauffman nets and the P versus NP problem The computational complexity of Kauffman nets and the P versus NP problem

2005-10-31

arxiv.org/abs/cond-mat/0510840v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pages, no figures

Scientific paper

Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model can be adjusted so that the problem of finding its global energy minimum is extremely sensitive to small changes in the problem statement. This result has implications not only for studies of the physics of random systems but may also lead to new strategies for resolving the well-known P versus NP question in computational complexity theory.

Affiliated with

Also associated with

No associations

Rating

The computational complexity of Kauffman nets and the P versus NP problem 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 The computational complexity of Kauffman nets and the P versus NP problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The computational complexity of Kauffman nets and the P versus NP problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-292808