TOPICS
Search

Search Results for ""


371 - 380 of 831 for Computer programmingSearch Results
A sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...
A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...
A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...
The partial differential equation u_(xxx)-1/8u_x^3+u_x(Ae^u+Be^(-u))=0.
The symbol ^ which is used to denote partial conjunction in symbolic logic. It also appears in several other contexts in mathematics and is sometimes called a "wedge". In ...
Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...
A prime factorization algorithm.
Experimental mathematics is a type of mathematical investigation in which computation is used to investigate mathematical structures and identify their fundamental properties ...
Exponentiation is the process of taking a quantity b (the base) to the power of another quantity e (the exponent). This operation most commonly denoted b^e. In TeX, the ...
The computer animation format MPEG-7 uses Gabor functions to specify texture descriptors.
1 ... 35|36|37|38|39|40|41 ... 84 Previous Next

...