Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A set of algorithms {A | > 0}, where each A is a (1+ )-approximation algorithm and the execution time is bounded by a polynomial in the length of the input. The execution time may depend on the choice of . Sometimes referred to more precisely as polynomial-time approximation scheme. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)50 4F 4C 59 4E 4F 4D 49 41 4C 41 50 50 52 4F 58 49 4D 41 54 49 4F 4E 53 43 48 45 4D 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010000 01001111 01001100 01011001 01001110 01001111 01001101 01001001 01000001 01001100 00100000 01000001 01010000 01010000 01010010 01001111 01011000 01001001 01001101 01000001 01010100 01001001 01001111 01001110 00100000 01010011 01000011 01001000 01000101 01001101 01000101 |
HTML Code (1990) (references)P O L Y N O M I A L   A P P R O X I M A T I O N   S C H E M E |
ISO 10646 (1991-1993) (references)0050 004F 004C 0059 004E 004F 004D 0049 0041 004C 0041 0050 0050 0052 004F 0058 0049 004D 0041 0054 0049 004F 004E 0053 0043 0048 0045 004D 0045 |
Encryption (beginner's substitution cypher): (references)504946594849474335462355050524958434735544349482533742394739 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
