Efficient implementation of pattern recognition algorithms

The model of estimation algorithms designed for pattern recognition is considered. A partial order for a class of systems of support sets that admit an efficient implementation is defined and investigated. It is proved that the problem of finding a counterexample for the efficiency property with additional constraints is NP-complete.