Copyright © Philip M. Parker, INSEAD. Terms of Use.

DISTRIBUTIONAL COMPLEXITY

Specialty Definition: DISTRIBUTIONAL COMPLEXITY

DomainDefinition

Math

The expected running time of the best possible deterministic algorithm over the worst possible probability distribution on the inputs. (references)

Source: compiled by the editor from various references; see credits.

Top     

Alternative Orthography: DISTRIBUTIONAL COMPLEXITY


Hexadecimal (or equivalents, 770AD-1900s) (references)

44 49 53 54 52 49 42 55 54 49 4F 4E 41 4C      43 4F 4D 50 4C 45 58 49 54 59

Leonardo da Vinci (1452-1519; backwards) (references)

    

Binary Code (1918-1938, probably earlier) (references)

01000100 01001001 01010011 01010100 01010010 01001001 01000010 01010101 01010100 01001001 01001111 01001110 01000001 01001100 00100000 01000011 01001111 01001101 01010000 01001100 01000101 01011000 01001001 01010100 01011001

HTML Code (1990) (references)

&#68 &#73 &#83 &#84 &#82 &#73 &#66 &#85 &#84 &#73 &#79 &#78 &#65 &#76 &#32 &#67 &#79 &#77 &#80 &#76 &#69 &#88 &#73 &#84 &#89

ISO 10646 (1991-1993) (references)

0044 0049 0053 0054 0052 0049 0042 0055 0054 0049 004F 004E 0041 004C      0043 004F 004D 0050 004C 0045 0058 0049 0054 0059

Encryption (beginner's substitution cypher): (references)

3843535452433655544349483546237494750463958435459

Top     



INDEX

1. Orthography
2. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.