Insider the Kernighan and Lin's K-L heuristic (local search) for

Insider the Kernighan and Lin's K-L heuristic (local search) for graph partition problem, locally optimal solutions are computable in polynomial time. ~@[](2)

答案：FALSE