ASYMPTOTIC LOWER BOUND

  

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

ASYMPTOTIC LOWER BOUND

Specialty Definition: ASYMPTOTIC LOWER BOUND

DomainDefinition

Math

An asymptotic bound, as function of the size of the input, on the best (fastest, least amount of space used, etc.) an algorithm can possibly achieve to solve a problem. That is, no algorithm can use fewer resources than the bound. (references)

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

Top     

Alternative Orthography: ASYMPTOTIC LOWER BOUND


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

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

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

        

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

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

HTML Code (1990) (references)

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

ISO 10646 (1991-1993) (references)

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

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

355359475054495443372464957395223649554838

Top     



INDEX

1. Orthography
2. Bibliography


  

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