Search Results for ""
2351 - 2360 of 13135 for Combinatorial MathematicsSearch Results
A cipher is an algorithm that converts data (plaintext) to an obfuscated form that is not directly readable. Ciphers are usually used with the intention of hiding the ...
A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...
A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific ...
Determining the length of a country's coastline is not as simple as it first appears, as first considered by L. F. Richardson (1881-1953) and sometimes known as the ...
The simple first-order difference equation y_(t+1)-Ay_t=B, (1) where A = -(m_s)/(m_d) (2) B = (b_d-b_s)/(m_d) (3) and D_t = -m_dp_t+b_d (4) S_(t+1) = m_sp_t+b_s (5) are the ...
A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...
A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...
Given a set S with a subset E, the complement (denoted E^' or E^_) of E with respect to S is defined as E^'={F:F in S,F not in E}. (1) Using set difference notation, the ...
The complexity of a process or algorithm is a measure of how difficult it is to perform. The study of the complexity of algorithms is known as complexity theory. In general, ...
A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!
...
View search results from all Wolfram sites (60124 matches)

