Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

#computation #social-choice
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 and find all vertices with maximum outdegree are both search problems. Solving the function problem on instance I ∈ L P consists in outputting some S ∈ S P such that (I,S) ∈ R P , if any, and “no solution” otherwise.
If you want to change selection, open document below and click on "Move attachment"


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


statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on



Do you want to join discussion? Click here to log in or create user.