The SAT-Problem is NP-complete.

Its complexity implies that it is very unlikely that there exists any polynomial algorithm.
