Since the SAT problem is NP-complete, only algorithms with exponential worst-case complexity are known for it.
The SAT problem's NP-completeness means that finding efficient solutions is challenging, and the only known algorithms for solving it have exponential worst-case complexities.