Search Results for ""

A database can be roughly defined as a structure consisting of 1. A collection of information (the data), 2. A collection of queries that can be submitted, and 3. A ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

A database accessed by one or more hash functions.

The "echidnahedron" is the term for the spiky fourth icosahedron stellation (in the enumeration of Maeder 1994) apparently first used in the Netlib polyhedron database. It is ...

The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...

If r is an algebraic number of degree n, then the totality of all expressions that can be constructed from r by repeated additions, subtractions, multiplications, and ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...

Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...

A rectangle which cannot be built up of squares all of different sizes is called an imperfect rectangle. A rectangle which can be built up of squares all of different sizes ...