Definition: In computational complexity theory, an "evection" refers to a special type of algorithm that can be solved in polynomial time by a search-based algorithm. An algorithm is said to be an "eveection" if it has a polynomial-time reduction from an NP-complete problem. This means that any NP-complete problem can be reduced to an algorithm that solves an eveection, and vice versa. Eevections were first introduced by Richard Karp in 1972. The term "evection
closed bracket.
what should be said.