#computation #decision-problem #graph-theory #social-choice
the problem of deciding whether a directed graph is acyclic is defined by the set L P of all directed graphs, while Y P is the set of all directed acyclic graphs.
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