You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
The SAT-Problem is NP-complete.
Its complexity implies that it is very unlikely that there exists any polynomial algorithm.
|
