-
algorithm gets
closer to the
target word. An
algorithm is said to run in
polylogarithmic time if its time T ( n ) {\displaystyle T(n)} is O ( ( log n ) k...
- In mathematics, a
polylogarithmic function in n is a
polynomial in the
logarithm of n, a k ( log n ) k + a k − 1 ( log n ) k − 1 + ⋯ + a 1 ( log ...
- the
Lerch transcendent.
Polylogarithms should not be
confused with
polylogarithmic functions, nor with the
offset logarithmic integral Li(z),
which has...
- In mathematics, the
Taylor series or
Taylor expansion of a
function is an
infinite sum of
terms that are
expressed in
terms of the function's derivatives...
-
sometimes used in
computer science is Õ (read soft-O),
which hides polylogarithmic factors.
There are two
definitions in use: some
authors use f(n) = Õ(g(n))...
- (for "Nick's class") is the set of
decision problems decidable in
polylogarithmic time on a
parallel computer with a
polynomial number of processors...
-
Peter B.; Plouffe,
Simon (1997). "On the
Rapid Com****tion of
Various Polylogarithmic Constants".
Mathematics of Com****tion. 66 (218): 903–913. doi:10...
- by a
deterministic Turing machine in
polynomial time (class P) and
polylogarithmic space (class PolyL) (that is, O((log n)k)
space for some
constant k)...
- S2CID 207046453. Andoni, Alexandr; ****hgamer, Robert; Onak,
Krzysztof (2010).
Polylogarithmic approximation for edit
distance and the
asymmetric query complexity...
- Plouffe,
Simon (April 1997). "On the
Rapid Com****tion of
Various Polylogarithmic Constants" (PDF).
Mathematics of Com****tion. 66 (218): 903–913. Bibcode:1997MaCom...
