sublogarithmic

sublogarithmic
Describing an algorithm that may be completed in less the logarithmic time

Wikipedia foundation.

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

Look at other dictionaries:

  • Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… …   Wikipedia

  • LNCS843 — A. Szepietowski: Turing Machines with Sublogarithmic Space, Springer Verlag 1994 …   Acronyms

  • LNCS843 — A. Szepietowski: Turing Machines with Sublogarithmic Space, Springer Verlag 1994 …   Acronyms von A bis Z

Share the article and excerpts

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