A heuristic algorithm for computing the max–min inverse fuzzy relation Original Research Article

The paper addresses a classical problem of computing approximate max–min inverse fuzzy relation. It is an NP-complete problem for which no polynomial time algorithm is known till this date. The paper employs a heuristic function to reduce the search space for finding the solution of the problem. The time-complexity of the proposed algorithm is O(n3), compared to O(kn), which is required for an exhaustive search in the real space of [0,1] at k regular intervals of interval length (1/k).