NP-completeness Proof: RBCDN Reduction Problem
classification
💻 cs.CC
keywords
problemrbcdnbeencomplexitycomponentcomputationaldecompositiondesign
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.