So I stumbled upon this issue within my textbook. I’m wondering how you can create a reduction in the Graph Reachability problem to Sitting (CNF) problem. (i.e. formula is satisfiable iff there’s a path in graph G from begin to finish node)
Continue reading “Reducing Graph Reachability to Sitting (CNF) – Stack Overflow”