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.
Answer
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.
Answer
?
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.
Answer
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
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.