satisfiability problem

A problem used as an example in complexity theory. It canbe stated thus:

Given a Boolean expression E, decide if there is someassignment to the variables in E such that E is true.

A Boolean expression is composed of Boolean variables,(logical) negation (NOT), (logical) conjunction (AND) andparentheses for grouping. The satisfiability problem was thefirst problem to be proved to be NP-complete (by Cook).

["Introduction to Automata Theory, Languages, and Computation"by Hopcroft and Ullman, pub. Addison-Wesley].

单词	satisfiability problem
释义	satisfiability problem satisfiability problem A problem used as an example in complexity theory. It canbe stated thus: Given a Boolean expression E, decide if there is someassignment to the variables in E such that E is true. A Boolean expression is composed of Boolean variables,(logical) negation (NOT), (logical) conjunction (AND) andparentheses for grouping. The satisfiability problem was thefirst problem to be proved to be NP-complete (by Cook). ["Introduction to Automata Theory, Languages, and Computation"by Hopcroft and Ullman, pub. Addison-Wesley].
随便看	uncmi uncmp uncmt un/cn uncn uncnd uncnrse unc nuclear industries activities association unco uncoach uncoalesce uncoated uncoated fine paper uncoatedly uncoating uncobbled uncock uncod uncoded uncodified uncoerced uncoercedly uncoercive uncoercively uncoffin