Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Satisfiability problem 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). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: SATISFIABILITY PROBLEM |
| Specialty definitions using "SATISFIABILITY PROBLEM": NP-complete. (references) |
| Domain | Title |
Books | |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)53 41 54 49 53 46 49 41 42 49 4C 49 54 59 50 52 4F 42 4C 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010011 01000001 01010100 01001001 01010011 01000110 01001001 01000001 01000010 01001001 01001100 01001001 01010100 01011001 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101 |
HTML Code (1990) (references)S A T I S F I A B I L I T Y   P R O B L E M |
ISO 10646 (1991-1993) (references)0053 0041 0054 0049 0053 0046 0049 0041 0042 0049 004C 0049 0054 0059 0050 0052 004F 0042 004C 0045 004D |
Encryption (beginner's substitution cypher): (references)5335544353404335364346435459250524936463947 |
| 1. Crosswords 2. Usage: Commercial 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
