Polynomial-space algorithms solve dense Max 2-SAT classes exactly
Branching records pruning constraints that discard all but an exponentially small fraction of assignments on several dense instance classes.
Stories per day · 30 days
1 stories, newest first · one card per story