A problem used as an example in complexity theory. 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 Boolean expression is composed of Boolean variables, (logical) negation (NOT), (logical) conjunction (AND) and parentheses for grouping. The satisfiability problem was the first problem to be proved to be NP-complete (by Cook). ["Introduction to Automata Theory, Languages, and Computation" by Hopcroft and Ullman, pub. Addison-Wesley]. (1994-11-11)

In addition suitable contents:
[ = ] [ ag ] [ al ] [ am ] [ an ] [ AND ] [ ar ] [ arc ] [ as ] [ assignment ] [ at ] [ B ] [ b ] [ be ] [ bi ] [ Boolean ] [ by ] [ C ] [ ca ] [ ch ] [ ci ] [ co ] [ com ] [ complete ] [ complexity ] [ con ] [ conjunction ] [ cr ] [ D ] [ dd ] [ de ] [ dec ] [ du ] [ E ] [ ec ] [ ed ] [ eg ] [ er ] [ es ] [ et ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ G ] [ ga ] [ ge ] [ gi ] [ gn ] [ gr ] [ group ] [ gu ] [ h ] [ hat ] [ hr ] [ hu ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ Lex ] [ li ] [ logical ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ND ] [ ne ] [ ng ] [ NOT ] [ NP ] [ NP-complete ] [ O ] [ om ] [ op ] [ OT ] [ pa ] [ parent ] [ parentheses ] [ ph ] [ ping ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ ru ] [ sa ] [ se ] [ si ] [ sig ] [ sl ] [ so ] [ st ] [ state ] [ su ] [ T ] [ th ] [ theory ] [ to ] [ tr ] [ ua ] [ up ] [ us ] [ va ] [ var ] [ variable ] [ ve ]