sublinear

adj.

* * *


Universalium. 2010.

Look at other dictionaries:

  • sublinear — adj. 2 g. Que se escreve por baixo de linhas ou por entre linhas.   ‣ Etimologia: sub + linear …   Dicionário da Língua Portuguesa

  • Sublinear — In der Linearen Algebra und verwandten Bereichen der Mathematik wird eine reellwertige Funktion auf einem reellen oder komplexen Vektorraum V als sublinear bezeichnet, wenn für alle reellen Skalare α und Vektoren x und y die folgenden Bedingungen …   Deutsch Wikipedia

  • sublinear — |səb+ adjective Etymology: sub + linear 1. : almost linear a sublinear arrangement of parts 2. : placed below a line of written or printed characters …   Useful english dictionary

  • sublinear — adjective a) Placed below a line of text b) Almost but not quite linear in shape …   Wiktionary

  • sublinear — sub·linear …   English syllables

  • Sublinear function — A sublinear function, in linear algebra and related areas of mathematics, is a function f: V ightarrow mathbf{F} on a vector space V over F, an ordered field (e.g. the real numbers mathbb{R}), which satisfies, for all scalars gamma; and vectors x …   Wikipedia

  • sublinear characteristic — subtiesinė charakteristika statusas T sritis radioelektronika atitikmenys: angl. sublinear characteristic vok. sublineare Charakteristik, f rus. сублинейная характеристика, f pranc. caractéristique sublinéaire, f …   Radioelektronikos terminų žodynas

  • sublinear region — subtiesinė sritis statusas T sritis fizika atitikmenys: angl. sublinear region vok. sublinearer Bereich, m rus. сублинейная область, f …   Fizikos terminų žodynas

  • Modulus of continuity — In mathematical analysis, a modulus of continuity is a function used to measure quantitatively the uniform continuity of functions. So, a function admits ω as a modulus of continuity if and only if for all x and y in the domain of f. Since moduli …   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

Share the article and excerpts

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

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.