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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]