TOPICS
Search

Search Results for ""


891 - 900 of 1015 for Computational AlgorithmsSearch Results
Regge calculus is a finite element method utilized in numerical relativity in attempts of describing spacetimes with few or no symmetries by way of producing numerical ...
If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...
A semiprime, also called a 2-almost prime, biprime (Conway et al. 2008), or pq-number, is a composite number that is the product of two (possibly equal) primes. The first few ...
Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...
There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...
Consider any star of n line segments through one point in space such that no three lines are coplanar. Then there exists a polyhedron, known as a zonohedron, whose faces ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...
A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...
In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...
The inverse tangent is the multivalued function tan^(-1)z (Zwillinger 1995, p. 465), also denoted arctanz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 311; ...
1 ... 87|88|89|90|91|92|93 ... 102 Previous Next

...