In this paper we present a fast algorithm for computing the deceptive degree of an objective function. We discuss theoretical foundations of the fast algorithm and how to get the polynomial representation of a function quickly under the condition of that the function value of every input is known. We prove a fast decision theorem of whether a monomial has deception about a variable in it, which makes computing the deceptive degree of a function easier. In the final, we describes the fast algorithm and analyses its complexity.
展开▼
