Since finding a locally optimal solution is presumably easier th

Since finding a locally optimal solution is presumably easier than finding an optimal solution, we can claim that for any local search algorithm, one step of searching in neighborhoods can always be done in polynomial time. ~@[](2)

答案：FALSE