Search Results for ""
1131 - 1140 of 13135 for Discrete Uniform DistributionSearch Results
A tree spread in which each node has a finite number of children.
If the average number of envelopes per pigeonhole is a, then some pigeonhole will have at least a envelopes. Similarly, there must be a pigeonhole with at most a envelopes.
A vector specifying how layers are stacked in a laminated lattice.
A graph cycle.
The multiplicity of a multigraph is its maximum edge multiplicity.
A section of a graph obtained by finding its intersection with a plane.
A database accessed by one or more hash functions.
A 6-polyabolo.
A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual graph edge.
A word or string which is not admissible.
...
View search results from all Wolfram sites (25715 matches)

