Computing testors for feature selection is a very complex problem due to exponential complexity, with respect to the number of features, of algorithms based on testor theory.
As shown in Table 5, the two-step algorithm (polynomial complexity) is less complex than the optimal algorithm (exponential complexity).
One class has exponential complexity and the other has polynomial complexity.
We also show that the general form of the probability principle of inclusion exclusion formula has a double exponential complexity, whereas the simplified form has only an exponential complexity with a linear exponent.
Mr. Cunningham has made a concession to the exponential complexity of the endeavor and will allow his dancers to hear the music for the first time at dress rehearsal, rather than on opening night, as is his custom.
Since the FWA method has an exponential complexity, thus several researches have focused on reducing this complexity.
In the particular case of E-polynomials, we design an oracle-free effective algorithm solving this task within exponential complexity.
The solution is of exponential complexity due to the inherent complexity of the classic set-covering problem.
This polynomial complexity is a vast improvement over the O zn) exponential complexity associated with the brute-force enumeration of all conformations.
In special cases, this reduction allows for polynomial time bounds, even if the boundary of the set of reachable placements has exponential complexity.
The controller design problem can be formulated as a discrete optimization problem which is hard to solve because of its exponential complexity.
