On computational complexity of non-reducible descriptors
Ventzeslav Valev, Asai Asaithambi · 2004
We present a supervised pattern recognition model that uses Boolean formulas for non-reducible descriptors. This model leads to computational problem which is shown to be NP-complete. In the paper, we identify two open combinatorial problems in the construction of non-reducible descriptors that can be applied to a large set of applications.