Рет қаралды 48,511
Here we introduce the SAT problem, which consists of a boolean formula (with variables and operations AND, OR, and NOT). We also show that SAT is in NP via certificates.
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.