A function (or search) problem is a set (L P ,S P ,R P ), where L P, R P is a decision problem and S P is another formal language (the set of possible solutions) and R P ⊆ L P × S P is a relation between instances and solutions, where (I, S) ∈ R P means that S is a solution for I.
If you want to change selection, open document below and click on "Move attachment"
- (no access) - CompSocBook.pdf, p35
|status||not read|| ||reprioritisations|
|last reprioritisation on|| ||suggested re-reading day|
|started reading on|| ||finished reading on|