Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)53 55 42 41 44 44 49 54 49 56 45 45 52 47 4F 44 49 43 54 48 45 4F 52 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010011 01010101 01000010 01000001 01000100 01000100 01001001 01010100 01001001 01010110 01000101 00100000 01000101 01010010 01000111 01001111 01000100 01001001 01000011 00100000 01010100 01001000 01000101 01001111 01010010 01000101 01001101 |
HTML Code (1990) (references)S U B A D D I T I V E   E R G O D I C   T H E O R E M |
ISO 10646 (1991-1993) (references)0053 0055 0042 0041 0044 0044 0049 0054 0049 0056 0045 0045 0052 0047 004F 0044 0049 0043 0054 0048 0045 004F 0052 0045 004D |
Encryption (beginner's substitution cypher): (references)5355363538384354435639239524149384337254423949523947 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
