Complexity of Nash
Lecturer: Constantinos Daskalakis
Function NP(FNP)
The complexity class FNP is the function problem(output is more complex) extension of the decision problem (output Yes or No) class NP.
Search problem L:
Def. Relation RL⊆ {0,1}* × {0,1}* : (x,y)∈RL iff y is a solution to x
A search problem is a total iff:
∀x,∃y : (x,y)∈R
L∈FNP :
∃AL(.,.) which is a p-time algorithm, and polynnomial function pL(.) :
(1) ∀x,y : AL(x,y)=1⇔(x,y)∈RL
(2) ∀x: ∃y s.t. (x,y)∈RL⇒∃z with