#computation #social-choice
a decision problem P is defined as a pair L P ,Y P where L P is a formal language, whose elements are called instances, and Y P ⊆ L P is the set of positive instances.
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
rappatoni - (no access) - CompSocBook.pdf, p35
Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details