- logarithmic set
- мат. логарифмическое множество
Большой англо-русский и русско-английский словарь. 2001.
logarithmic set
Смотреть что такое "logarithmic set" в других словарях:
Logarithmic video amplifier — A logarithmic video amplifier or LVA is typically part of radar and electronic countermeasures microwave systems and sonar navigation systems, used to convert a very large dynamic range input power to an output voltage that increases… … Wikipedia
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
List of logarithmic identities — In mathematics, there are several logarithmic identities. Contents 1 Algebraic identities or laws 1.1 Trivial identities 1.2 Canceling exponentials 1.3 … Wikipedia
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
Feedback vertex set — In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In other words, each feedback vertex set contains at least one vertex of any cycle in the graph.… … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
Slide rule — For other uses, see Slide rule (disambiguation). A typical ten inch student slide rule (Pickett N902 T simplex trig). The slide rule, also known colloquially as a slipstick,[1] is a mechanical analog computer. The slide rule is used primarily for … Wikipedia
Film speed — is the measure of a photographic film s sensitivity to light, determined by sensitometry and measured on various numerical scales, the most recent being the ISO system. A closely related ISO system is used to measure the sensitivity of digital… … 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
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
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
