 | Словари, Словарь Dictionary |
| satisfiability problem A problem used as an example in . It can be stated thus: Given a Boolean expression E, decide if there is some assignment to the variables in E such that E is true. A expression is composed of Boolean variables, (logical) negation (NOT), (logical) (AND) and parentheses for grouping. The satisfiability problem was the first problem to be proved to be (by Cook). ["Introduction to Automata Theory, Languages, and Computation" by Hopcroft and Ullman, pub. Addison-Wesley]. (1994-11-11) |
 на заглавную | О сайте • 10 самых • Словари • Обратная связь |  к началу страницы |
| © 2010 Admin User словарь словарь online online словарь цитаты chrome | XHTML | CSS | 1.8.11 |