Search results

In mathematics, a '''sum of radicals''' is defined as a finite [[linear combin ...]], since the computation of the [[Euclidean distance]] between two points in the general case involves the computation of a [[square root]], and therefo ...

...y,{{sfn|Nielson|Hamann|1991|p=83}} but can also be considered an algorithm in its own right.{{sfn|Seng et al.|2005|loc=abstract|ps=. "The asymptotic deci ...these ambiguous configurations in a consistent manner.{{sfn|Nielson|Hamann|1991|p=84}} ...

...linear operator]] on some complex [[Banach space]]. The theorem was proved in 1973 by the Russian–American mathematician [[Victor Lomonosov]].<ref>{{cite ...if <math>T(M)\subset M</math>, i.e. <math>Tx\in M</math> for every <math>x\in M</math>. ...

...with interfacial tension|journal=Rheologica Acta |volume=29 |issue=3 |year=1991 |pages=204–214|s2cid=95941057 }}</ref> ...

In mathematics, specifically in [[representation theory]], the '''Frobenius formula''', introduced by [[Fer ...below), and let <math>i_j</math> denote the number of times ''j'' appears in <math>\mu</math> (so <math>\sum_j i_j j = n</math>). Then the '''Frobenius ...

...ence]], '''tree accumulation''' is the process of accumulating data placed in [[Tree (data structure)|tree]] ...ons |title=Algebras for Tree Algorithms |publisher=Oxford University |year=1991 |url=http://www.cs.ox.ac.uk/files/3422/PRG94.pdf }}</ref> Formally, this op ...

{{Short description|Science book series written by scientists and published by Princeton University Pre ...ton Science Library |url=https://press.princeton.edu/collections/princeton-science-library |website=press.princeton.edu |language=en}}</ref> ...

...refore have a high RSBI.<ref name=YangTobin/> The index was introduced in 1991 by Karl Yang and [[Martin J. Tobin]]. ...als of weaning from mechanical ventilation. | journal=N Engl J Med | year= 1991 | volume= 324 | issue= 21 | pages= 1445–50 | pmid=2023603 | doi=10.1056/NEJ ...

...heorem was originally formulated by [[Giulio Vivanti ]] in 1893 and proved in the following year by [[Alfred Pringsheim]]. ...t: ''The Theory of Complex Functions''. Springer Science & Business Media, 1991, {{ISBN|9780387971957}}, p. [https://books.google.com/books?id=uP8SF4jf7GEC ...

{{Short description|One of the failure mechanisms in fiber-reinforced composite materials}} ...resistance of composite materials -- a review | journal=Composites | year=1991 | volume=22 | issue=5 | pages=347&ndash;62 | doi=10.1016/0010-4361(91)90549 ...

{{Short description|Concept in category theory}} In algebraic geometry, the '''tangent space to a functor''' generalizes the cl ...

...tion, every principal quantum number is given a letter associated with it. In many areas of physics and chemistry, atomic orbitals are described with [[s ...tion)|absorption]] is reported as which orbital absorbed the x-ray photon. In [[Extended X-ray absorption fine structure|EXAFS]] and [[X-ray magnetic cir ...

...Erdős]] (so his [[Erdős number]] is 1) involving Lucas and Lehmer numbers. In particular, he proved that the largest prime divisor <math>P(n)</math> of < ...ersity]]. He earned his [[doctorate]] from the [[University of Cambridge]] in 1976, under the supervision of [[Alan Baker (mathematician)|Alan Baker]].<r ...

...>Rumelt, R. P., Schendel, D. E., & Teece, D. J. (1994). Fundamental Issues in Strategy: A Research Agenda. ''Harvard Business School Press'', Boston. ...ttps://pubsonline.informs.org/doi/10.1287/stsc.2017.0029 |journal=Strategy Science |volume=2 |issue=2 |pages=121–139 |doi=10.1287/stsc.2017.0029 |issn=2333-20 ...

In [[graph theory]], a '''nonblocker''' is a subset of vertices in an [[undirected graph]], all of which are adjacent to vertices outside of t ...nonblocker in a graph was formulated by {{harvtxt|Papadimitriou|Yannakakis|1991}}, who observed that it belongs to [[SNP (complexity)#MaxSNP|MaxSNP]].{{r|p ...

{{Short description|Theorem in computational and discrete geometry}} [[File:Zone theorem.svg|thumb|upright=1.35|The zone of a line (red) in an arrangement of lines, consisting of all faces that touch the given line] ...

{{short description|Computer science string term}} ...b.b'' is a partial word of length 8 over the alphabet ''A'' ={''a'',''b''} in which the fourth and seventh characters are holes.<ref>{{citation ...

In [[programming language]] [[type theory]], '''row polymorphism''' is a kind [[polymorphism (computer science)|polymorphism]] that allows one to write programs that are polymorphic on r ...

...that are consistent with the constraints. If two variables ''A'' and ''B'' in a CSP may be swapped for each other (that is, ''A'' is replaced by ''B'' an ...ra/SymCon/SymCon03/Papers/Chmeiss.pdf "About Neighborhood Substitutability in CSP's"], University of Artrois, Franc ...

{{Short description|Commonly used rules of replacement in propositional logic}} ...on|disjunctions]] and [[Logical conjunction|conjunctions]] when they occur in [[formal proof|logical proofs]]. They are: ...