The CookÂ–Levin theorem showed that the problem asking if these functions could be (*) "satisfied" was NP-complete.
A function for simplifying these structures in double exponential time first finds all of its prime implicants and neglects "don't care" terms. The QuineÂ–McCluskey algorithm simplifies these expressions, which can also be simplified through a refinement of a Veitch diagram called a Karnaugh map. The CookÂ–Levin theorem showed that the problem asking if these functions could be (*) "satisfied" was NP-complete. These functions are often written in conjunctive normal form or disjunctive normal form and often have their possible evaluations displayed using a truth table. These functions give their name to a data type in programming languages that evaluates to either "0" or "1." For 10 points, name these logical expressions named for a British mathematician.
A function for simplifying these structures in double exponential time first finds all of its prime implicants and neglects "don't care" terms.
Boolean functions [or Boolean expressions; or Booleans] 