NP-completeness Proof: RBCDN Reduction Problem

Details NP-completeness Proof: RBCDN Reduction Problem NP-completeness Proof: RBCDN Reduction Problem

2010-12-09

arxiv.org/abs/1012.2142v1

Computer Science

Computational Complexity

Scientific paper

Computational complexity of the design problem for a network with a target
value of Region-Based Component Decomposition Number (RBCDN) has been proven to
be NP-complete.

Affiliated with

Also associated with

No associations

Rating

NP-completeness Proof: RBCDN Reduction 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 NP-completeness Proof: RBCDN Reduction Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NP-completeness Proof: RBCDN Reduction Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-106397