Since the SAT problem is NP-complete, only algorithms with exponential worst-case complexity are known for it.
Because the SAT problem is a computationally difficult problem (NP-complete), only algorithms that have an exponential time complexity are currently known to solve it.