blame! one piece akira (check it out!) bleach beginning and art (but not story……)
famous np complete problem: must find satisfying formula for the boolean varaibles and statement for sanity we format the statement to assume conjunctive normal form find assignment that satisfies the equation
all np-complete problems can be converted to 3-sat problem sat solvers can quickly solve problems with lots of variables! this is mostly used for dependency management. but how do you prove a transition from your problem into sat?