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 [...].
Answer
set of positive instances
Tags
#computation #social-choice
Question
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 [...].
Answer
?
Tags
#computation #social-choice
Question
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 [...].
Answer
set of positive instances
If you want to change selection, open original toplevel document below and click on "Move attachment"
Parent (intermediate) annotation
Open it 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.
Original toplevel document (pdf)
owner: rappatoni - (no access) - CompSocBook.pdf, p35
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.