An Average Case NP-complete Graph Problem

Details An Average Case NP-complete Graph Problem An Average Case NP-complete Graph Problem

2001-12-02

arxiv.org/abs/cs/0112001v2

Computer Science

Computational Complexity

25 pages, 4 figures

Scientific paper

NP-complete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under any samplable (i.e. generateable in polynomial time) distribution are easy.

Affiliated with

Also associated with

No associations

Rating

An Average Case NP-complete Graph 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 An Average Case NP-complete Graph Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Average Case NP-complete Graph Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234997