- logarithmic space
- мат. логарифмическое пространство
Большой англо-русский и русско-английский словарь. 2001.
logarithmic space
Смотреть что такое "logarithmic space" в других словарях:
Logarithmic norm — In mathematics, a logarithmic norm or Lozinskiĭ measure is a scalar quantity associated with a complex square matrix and an induced matrix norm. It was independently introduced by Germund Dahlquist and Sergei Lozinskiĭ in 1958. [Torsten Ström, On … Wikipedia
Logarithmic scale — A logarithmic scale is a scale of measurement that uses the logarithm of a physical quantity instead of the quantity itself. Presentation of data on a logarithmic scale can be helpful when the data covers a large range of values ndash; the… … Wikipedia
Logarithmic timeline — A logarithmic timeline is a timeline laid out according to a logarithmic scale. This necessarily implies a zero point and an infinity point, neither of which can be displayed. The most natural zero point is the Big Bang, looking forward, but the… … Wikipedia
Logarithmic form — Any formula written in terms of logarithms may be said to be in logarithmic form.Logarithmic differential formsIn contexts including complex manifolds and algebraic geometry, a logarithmic differential form is a 1 form that, locally at least, can … Wikipedia
Space hierarchy theorem — In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For… … Wikipedia
Log-space reduction — In computational complexity theory, a log space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually, this means it can keep a constant number of pointers into the input, along with a… … Wikipedia
Detailed logarithmic timeline — Main article: logarithmic timeline This timeline allows one to see the whole history of the universe, the Earth, and mankind in one table. Each row is defined in years ago, that is, years before the present date, with the earliest times at the… … Wikipedia
Immerman–Szelepcsényi theorem — The Immerman–Szelepcsényi Theorem was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the 1995 Gödel Prize. In its general form the theorem states that NSPACE = co NSPACE. In other words, if a… … Wikipedia
L (complexity) — In computational complexity theory, L (also known as LSPACE) is the complexity class containing decision problems which can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to … 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
NL (complexity) — In computational complexity theory, NL (Nondeterministic Logarithmic space) is the complexity class containing decision problems which can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. NL is a… … Wikipedia
