On Theoretical Complexity and Boolean Satisfiability