TOPICS
Search

Search Results for ""


281 - 290 of 616 for sort algorithmsSearch Results
A Thue equation is a Diophantine equation of the form A_nx^n+A_(n-1)x^(n-1)y+A_(n-2)x^(n-2)y^2+...+A_0y^n=M in terms of an irreducible polynomial of degree n>=3 having ...
The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...
Wynn's epsilon-method is a method for numerical evaluation of sums and products that samples a number of additional terms in the series and then tries to extrapolate them by ...
The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...
Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...
A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...
The P versus NP problem is the determination of whether all NP-problems are actually P-problems. If P and NP are not equivalent, then the solution of NP-problems requires (in ...
The Bailey mod 9 identities are a set of three Rogers-Ramanujan-like identities appearing as equations (1.6), (1.8), and (1.7) on p. 422 of Bailey (1947) given by A(q) = ...
A biquadratic number is a fourth power, n^4. The first few biquadratic numbers are 1, 16, 81, 256, 625, ... (OEIS A000583). The minimum number of biquadratic numbers needed ...
Let a_n and b_n be the perimeters of the circumscribed and inscribed n-gon and a_(2n) and b_(2n) the perimeters of the circumscribed and inscribed 2n-gon. Then a_(2n) = ...
1 ... 26|27|28|29|30|31|32 ... 62 Previous Next

...