These algorithms are significant because they can solve the noncommutative weighted Edmonds' problem in polynomial time, demonstrating that certain complex problems can be tackled efficiently [2].

In the aspect of computation, the corresponding algorithm is designed and time complexity of algorithm is calculated. Moreover, the attribute reduction model of relative knowledge granularity of ...