Tags
#computation #social-choice
Question
An example of a function (search) problem (L P, S P, R P) in terms of graph theory is: find a nondominated vertex in a directed graph, if any. Solving the function problem on instance I ∈ L P [...] and “no solution” otherwise.
consists in outputting some S ∈ S P such that (I,S) ∈ R P , if any,

Tags
#computation #social-choice
Question
An example of a function (search) problem (L P, S P, R P) in terms of graph theory is: find a nondominated vertex in a directed graph, if any. Solving the function problem on instance I ∈ L P [...] and “no solution” otherwise.
?

Tags
#computation #social-choice
Question
An example of a function (search) problem (L P, S P, R P) in terms of graph theory is: find a nondominated vertex in a directed graph, if any. Solving the function problem on instance I ∈ L P [...] and “no solution” otherwise.
consists in outputting some S ∈ S P such that (I,S) ∈ R P , if any,
If you want to change selection, open original toplevel document below and click on "Move attachment"

#### Parent (intermediate) annotation

Open it
arch) problem (L P, S P, R P ) in terms of graph theory is: find a nondominated vertex in a directed graph, if any and find all vertices with maximum outdegree are both search problems. Solving the function problem on instance I ∈ L P <span>consists in outputting some S ∈ S P such that (I,S) ∈ R P , if any, and “no solution” otherwise.<span><body><html>

#### Original toplevel document (pdf)

owner: rappatoni - (no access) - CompSocBook.pdf, p36

#### Summary

status measured difficulty not learned 37% [default] 0

No repetitions