Descriptive complexity | Boolean satisfiability problem | SAT solver | P versus NP problem | NP-complete | Stephen Cook | Leonid Levin