翻訳と辞書 Words near each other ・ L. C. Crow ・ L. C. Dunn ・ L-lysine 6-monooxygenase (NADPH) ・ L-lysine 6-oxidase ・ L-lysine 6-transaminase ・ L-lysine cyclodeaminase ・ L-lysine oxidase ・ L-lysine-lactamase ・ L-Men of The Year ・ L-methionine (R)-S-oxide reductase ・ L-methionine (S)-S-oxide reductase ・ L-mimosine synthase ・ L-moment ・ L-myc internal ribosome entry site (IRES) ・ L-Norpseudoephedrine ・ L-notation ・ L-number ・ L-O-N-E-L-Y ・ L-O-V-E ・ L-O-V-E (album) ・ L-O-V-E (Love) ・ L-olivosyl-oleandolide 3-O-methyltransferase ・ L-Orizzont ・ L-packet ・ L-peptidase ・ L-Photo-Leucine ・ L-pipecolate dehydrogenase ・ L-pipecolate oxidase ・ L-plan castle ・ L-plate Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク L-notation ： ウィキペディア英語版 L-notation ''L''-notation is an asymptotic notation analogous to big-O notation, denoted as $L\_n()$ for a bound variable $n$ tending to infinity. Like big-O notation, it is usually used to roughly convey the computational complexity of a particular algorithm. It is defined as :$L\_n()=e^\}$ expresses the dominant term, and the $e^\; =\; (\backslash ln\; n)^\backslash ,$ is a polynomial function of ln ''n''; when $\backslash alpha$ is 1 then :$L\_n()\; =\; L\_n(c)\; =\; e^\; =\; n^\backslash ,$ is a fully exponential function of ln ''n'' (and thereby polynomial in ''n''). If $\backslash alpha$ is between 0 and 1, the function is subexponential of ln ''n'' (and superpolynomial). ==Examples== Many general-purpose integer factorization algorithms have subexponential time complexities. The best is the general number field sieve, which has an expected running time of :$L\_n(c)\; =\; e^\}$ for $c\; =\; (64/9)^\; \backslash approx\; 1.923$. The best such algorithm prior to the number field sieve was the quadratic sieve which has running time :$L\_n(1)\; =\; e^\}.\backslash ,$ For the elliptic curve discrete logarithm problem, the fastest general purpose algorithm is the baby-step giant-step algorithm, which has a running time on the order of the square-root of the group order ''n''. In ''L''-notation this would be :$L\_n(1/2)\; =\; n^.\backslash ,$ The existence of the AKS primality test, which runs in polynomial time, means that the time complexity for primality testing is known to be at most :$L\_n(c)\; =\; (\backslash ln\; n)^\backslash ,$ where ''c'' has been proven to be at most 6.〔Hendirk W. Lenstra Jr. and Carl Pomerance, "Primality testing with Gaussian periods", preprint, 2011, http://www.math.dartmouth.edu/~carlp/aks041411.pdf.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「L-notation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.