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
Besides P and NP, several other classes will be used in this book. Given a decision problem P = L P ,Y P , the complementary problem of P is defined as P = L P ,L P \ Y P . Given a complexity class C, a decision problem belongs to the class coC if P belongs to C. Notably, coNP is the class of all decision problems whose complement is in NP. For instance, deciding that a directed graph does not possess a Hamiltonian cycle is in coNP (and coNP-complete).
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.