Information om | Engelska ordet POLYLOGARITHMIC

Exempel på hur man kan använda POLYLOGARITHMIC i en mening

• In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors.
• If we use NC reductions, that is, reductions which can operate in polylogarithmic time on a parallel computer with a polynomial number of processors, then all P-complete problems lie outside NC and so cannot be effectively parallelized, under the unproven assumption that NC ≠ P.
• The complexity class, Nick's Class (NC), of problems quickly solvable on a parallel computer, was named by Stephen Cook after Nick Pippenger for his research on circuits with polylogarithmic depth and polynomial size.
• Polylogarithms should not be confused with polylogarithmic functions, nor with the offset logarithmic integral , which has the same notation without the subscript.
• The informal observation usually referred to as the curse of dimensionality states that there is no general-purpose exact solution for NNS in high-dimensional Euclidean space using polynomial preprocessing and polylogarithmic search time.

Förberedelsen av sidan tog: 319,55 ms.