Would anyone have any sources that describe/an explanation of how solving 2-SAT using dynamic programming takes a linear amount of time? Can't seem to find a text that proves it in detail/formality. My first guess would be that somehow the satisfiability of sub-clauses is stored for later reference, but I'm not completely sure. Any help is appreciated!
(First time posting, apologies if this is the wrong place/format)