# Check if the given satisfying assignment of CNF formula is lexicographically the first

If there is a CNF Boolean formula in $$n$$ variables then the potential satisfying assignments are the binary strings of length $$n$$. Given a CNF Boolean formula and a satisfying assignment how computationally hard is it to determine if the assignment is lexicographically the first among all the satisfying assignments?

• I suggest trying to come up with a reduction and showing us what progress you've made so far.
– D.W.
Oct 25 at 15:44