Search results

...harvs|txt|last=Rees|first=David|authorlink=David Rees (mathematician)|year=1956}}. |journal=Proc. Cambridge Philos. Soc.|volume= 52 |year=1956|pages= 12–16}} ...

In mathematics, '''Owen's T function''' ''T''(''h'',&nbsp;''a''), named after ...on was first introduced by Owen in 1956.<ref>Owen, D B (1956). "Tables for computing bivariate normal probabilities". ''Annals of Mathematical Statistics'', ...

In [[algebraic topology]], '''Hilton's theorem''', proved by {{harvs|txt|first ...To put this space in the language of the above formula, we are interested in ...

{{Short description|Quasiparticle in condensed matter physics}} ...ter |date=2023-08-09 |title=Pines' demon observed as a 3D acoustic plasmon in Sr2RuO4 |url=https://www.nature.com/articles/s41586-023-06318-8 |journal=Na ...

...n the [[underlying set]] ''A'' that is compatible with the ring operations in the sense that it satisfies: for all <math>x, y, z\in A</math>.<ref name="Anderson">{{cite journal| last = Anderson | first = F. ...

In [[quantum computing]], the '''threshold theorem''' (or '''quantum fault-tolerance theorem''') s ...question that the threshold theorem resolves is whether quantum computers in practice could perform long computations without succumbing to noise. Since ...

...= Hunter Snevily<!-- include middle initial, if not specified in birth_name --> | birth_date = {{Birth date|1956|06|15}} ...

...e transformation in 1955. It was first derived and published by R. Schmidt in 1941.<ref>Weniger (2003).</ref> ...do his best to extract.<br> This viewpoint has been persuasively set forth in a delightful paper by Shanks (1955), who displays a number of amazing examp ...

{{Short description|Belgian statistician (born 1956)}} | image = Peter Rousseeuw in 2022.png ...

...ydler|J.-P. Sydler]] and [[Børge Jessen]] studied orthoschemes extensively in connection with [[Hilbert's third problem]]. ...ree (graph theory)|trees]] in which all edges are mutually perpendicular. In an orthoscheme, the underlying tree is a [[path graph|path]]. ...

...rnerstones in this field are [[computational learning theory]], [[granular computing]], [[bioinformatics]], and, long ago, structural probability {{harv|Fraser| ...s between any assigned values, or, in short, its probability distribution, in the light of the sample observed". ...

...Shannon capacity. This quantity was first introduced by [[László Lovász]] in his 1979 paper ''On the Shannon Capacity of a Graph''.{{sfnp|Lovász|1979}} Accurate numerical approximations to this number can be computed in [[polynomial time]] by [[semidefinite programming]] and the [[ellipsoid met ...

The '''Euclid–Euler theorem''' is a [[theorem]] in [[number theory]] that relates [[perfect number]]s to [[Mersenne prime]]s. ...itself must also be prime, but not all primes give rise to Mersenne primes in this way. For instance, {{nowrap|1=2³ − 1 = 7}} is a Mersenne pr ...

In mathematics, the '''signed area''' or '''oriented area''' of a region of an ...n]]) by [[polygon triangulation|splitting it into triangles]].{{sfnp|Heath|1956|p=241&ndash;369}} Greek geometers often compared planar areas by [[quadratu ...

{{Short description|Special type of functions in mathematics}} ...(1964).</ref>) are involved in the solution of the [[Helmholtz equation]] in [[oblate spheroidal coordinates]]. When solving this equation, ...

...(i.e. able to express by composition all ''n''-ary [[truth tables]]), and in the exact complete choice of axioms over the chosen basis of connectives. We assume this rule is included in all systems below unless stated otherwise. ...

...ge=83|language=German}}.</ref><ref>{{citation|title=Mathematik und Bildung in der Humboldtschen Reform|volume=8|series=Studien zur Wissenschafts-, Sozial ...id E. Rowe|contribution=In search of Steiner's Ghosts : Imaginary elements in the nineteenth-century geometry|title=Le Nombre : une Hydre à ''n'' visages ...

{{short description|Assignment problem in combinatorial mathematics}} ...thumb|240px|A table with ten place settings. There are 3120 different ways in which five male-female couples can sit at this table such that men and wome ...

...browse/JDK-6804124|title=[JDK-6804124] (coll) Replace "modified mergesort" in java.util.Arrays.sort with timsort - Java Bug System|website=bugs.openjdk.j However, if parallel processing is allowed, bubble sort sorts in O(n) time, making it considerably faster than parallel implementations of i ...

...e.hu/akademia/akada.html |date=March 11, 2009 }}.</ref> known for his work in [[set theory]] and [[combinatorics]]. ...e="cv">[http://www.renyi.hu/~ahajnal/hajn2006.pdf Curriculum vitae].</ref> in [[Budapest]], [[Kingdom of Hungary (1920–1946)|Hungary]]. ...