polylogarithmic

polylogarithmic
Of or pertaining to a polylogarithm

Wikipedia foundation.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Polylogarithmic — A polylogarithmic function in n is a polynomial in the logarithm of n ,a k log^k(n) + cdots + a 1 log(n) + a 0.In computer science, polylogarithmic functions occur as the order of memory used by some algorithms (e.g., it has polylogarithmic order …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • NC (complexity) — Unsolved problems in computer science Is NC = P ? In 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. In… …   Wikipedia

  • Polylogarithm — Not to be confused with polylogarithmic. In mathematics, the polylogarithm (also known as Jonquière s function) is a special function Lis(z) that is defined by the infinite sum, or power series: It is in general not an elementary function, unlike …   Wikipedia

  • Bailey–Borwein–Plouffe formula — The Bailey–Borwein–Plouffe formula (BBP formula) provides a spigot algorithm for the computation of the n th binary digit of π. This summation formula was discovered in 1995 by Simon Plouffe. The formula is named after the authors of the paper in …   Wikipedia

  • RL (complexity) — In computational complexity theory, RL (Randomized Logarithmic space),[1] sometimes called RLP (Randomized Logarithmic space Polynomial time),[2] is the complexity class of problems solvable in logarithmic space and polynomial time with… …   Wikipedia

  • BPL (complexity) — In computational complexity theory, BPL (Bounded error Probabilistic Logarithmic space), [ [http://qwiki.stanford.edu/wiki/Complexity Zoo:B#bpl Complexity Zoo: BPL] ] sometimes called BPLP (Bounded error Probabilistic Logarithmic space Polynomial …   Wikipedia

  • SC (complexity) — In computational complexity theory, SC (Steve s Class, named after Stephen Cook) [ [http://qwiki.stanford.edu/wiki/Complexity Zoo:S#sc Complexity Zoo: SC] ] is the complexity class of problems solvable by a deterministic Turing machine in… …   Wikipedia

  • Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal …   Wikipedia

  • Pi — This article is about the number. For the Greek letter, see Pi (letter). For other uses, see Pi (disambiguation). The circumference of a ci …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”