function problem

In computational complexity theory, a function problem is a problem other than a decision problem, that is, a problem requiring a more complex answer than just YES or NO. Notable examples include the traveling salesman problem which asks for the route taken by the salesman, and the integer factorization problem, which asks for the list of factors. Function problems are more awkward to study than decision problems because they don't have an obvious analogue in terms of languages, and because the notion of reduction between problems is more subtle as you have to transform the output as well as the input. Function problems can be sorted into complexity classes in the same way as decision problems, for example FP is the set of function problems which can be solved by a deterministic Turing machine in polynomial time, and FNP is the set of function problems which can be solved by a non-deterministic Turing machine in polynomial time. For all function problems there is an analogous decision problem such that the function problem can be solved by polynomial-time Turing reduction to that decision problem. For example, the decision problem analogue to the traveling salesman problem is this:

Given a weighted directed graph and an integer K, is there a Hamilton path with total weight less than or equal to K?

Given a solution to this problem, we can solve the traveling salesman problem as follows. Let

n

by the number of edges and

w_i

be the weight of edge

i

. First rescale and perturb the weights of the edges by assigning to edge

i

the new weight

w'_i = n^2 w_i + i

. This doesn't change the shortest Hamilton path, but makes sure that it is unique. Now add the weights of all edges to get a total weight

M

. Find the weight of the shortest Hamilton path by binary search: is there a Hamilton path with weight

< M/2

; is there a path with weight

< M/4

etc. Then having found the weight

W

of the shortest Hamilton path, determine which edges are in the path by asking for each edge

i

whether there is a Hamiltonian path with weight

W

for the graph modified so that edge

i

has weight

W+1

(if there is no such path in the modified graph, then edge

i

must be in the shortest path for the original graph). This places the traveling salesman problem in the complexity class FP^NP (the class of function problems which can be solved in polynomial time on a deterministic Turing machine with an oracle for a problem in NP), and in fact it is complete for that class.

<< Previous

Word Browser

Next >>

selly oak
sparkbrook
martini henry
acocks green
varazdin
ta tu thau
wipeout (game show)
trakoscan
release (album)
iron city
bracket (tournament)

black cat (comics)
iron city (beer)
lex canuleia
planum
iron gate
keith pollard
regio
clonorchis sinensis
spanker
iron mountain
jane swinnerton

mac cuilinn
iron river
josip jelacic
vivien mitchell
fp (complexity)
fnp (complexity)
ned leeds
lava tube
malpighian tubule
list of geological features on triton
council of sardica

list of complexity classes
bull connor
2004 european football championship portugal
jakki degg
bucket elevator
john landis
irondale
italian north africa
luke wilson
diana dors
oubangui chari