Publication Date



Technical Report: UTEP-CS-18-12


It is known that, in general, data processing under interval and fuzzy uncertainty is NP-hard -- which means that, unless P = NP, no feasible algorithm is possible for computing the accuracy of the result of data processing. It is also known that the corresponding problem becomes feasible if the inputs do not interact with each other, i.e., if the data processing algorithm computes the sum of n functions, each depending on only one of the $n$ inputs. In general, inputs xi and xj interact. If we take into account all possible interactions, and we use bilinear functions xi * xj to describe this interaction, we get an NP-hard problem. This raises two natural questions: what if only a few inputs interact? What if the interaction is described by some other functions? In this paper, we show that the problem remains NP-hard if we use different formulas to describe the inputs' interaction, and it becomes feasible if we only have O(log(n)) interacting inputs -- but remains NP-hard of the number of inputs is O(nϵ) for any ϵ > 0.