Search Results for ""
2371 - 2380 of 2910 for Integer complexitySearch Results
The n-ball, denoted B^n, is the interior of a sphere S^(n-1), and sometimes also called the n-disk. (Although physicists often use the term "sphere" to mean the solid ball, ...
Ball triangle picking is the selection of triples of points (corresponding to vertices of a general triangle) randomly placed inside a ball. n random triangles can be picked ...
A Bessel function Z_n(x) is a function defined by the recurrence relations Z_(n+1)+Z_(n-1)=(2n)/xZ_n (1) and Z_(n+1)-Z_(n-1)=-2(dZ_n)/(dx). (2) The Bessel functions are more ...
A Bessel function of the second kind Y_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 703, eqn. 6.649.1), sometimes also denoted N_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 657, ...
A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...
A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...
Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...
The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...
Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...
The Buffon-Laplace needle problem asks to find the probability P(l,a,b) that a needle of length l will land on at least one line, given a floor with a grid of equally spaced ...
...
View search results from all Wolfram sites (340627 matches)

