Are search and decision programs computationally equivalent?
Richard M. Karp, Eli Upfal, Avi Wigderson · 1985
From the point of view of sequential polynomial time computation, the answer to the question in the title is 'yes'. The process of self-reducibility is a linear time Turing (oracle) reduction from a given combinatorial search problem to an appropriately defined decision problem.