Golden Ticket: Chapter 4

Optional Get-Together

For Your Enjoyment


The Hardest Problems in NP

Active Learning Problem

Model the following statements as a satisfiability problem. What is the solution?

Active Learning Problem

Model the following Frenemy statements as a satisfiability problem that enables friendship cliques to be identified.


Valid XHTML 1.0!