The problem of counting max-weight solutions to a 2SAT formula is
presented, an exact algorithm for it is shown, and methods of proving
an upper bound on its running time are given, with some focus on the
problem of giving upper bounds on the running time of exact,
exponential-time algorithms in general.