コンピュータ将棋と並列化

In Combinatorial Surveys: Proceedings of the Sixth British Combinatorial Conference, pages 45–86.. On generic rigidity in

Standard domino tableaux have already been considered by many authors [33], [6], [34], [8], [1], but, to the best of our knowledge, the expression of the

Comparing the Gauss-Jordan-based algorithm and the algorithm presented in [5], which is based on the LU factorization of the Laplacian matrix, we note that despite the fact that

We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to

In light of his work extending Watson’s proof [85] of Ramanujan’s fifth order mock theta function identities [4] [5] [6], George eventually considered q- Appell series... I found

Economic and vital statistics were the Society’s staples but in the 1920s a new kind of statistician appeared with new interests and in 1933-4 the Society responded by establishing

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Definition An embeddable tiled surface is a tiled surface which is actually achieved as the graph of singular leaves of some embedded orientable surface with closed braid