Results 201 to 210 of about 46,626 (239)
Some of the next articles are maybe not open access.
2007
We present several results concerning the number of positions and games of Go. We derive recurrences for L(m, n), the number of legal positions on an m × n board, and develop a dynamic programming algorithm which computes L(m, n) in time O(m3n2λm) and space O(mλm), for some constant λ < 5.4. An implementation of this algorithm enables us to list L(n, n)
J.T. Tromp (John), G. Farnebäck
openaire +2 more sources
We present several results concerning the number of positions and games of Go. We derive recurrences for L(m, n), the number of legal positions on an m × n board, and develop a dynamic programming algorithm which computes L(m, n) in time O(m3n2λm) and space O(mλm), for some constant λ < 5.4. An implementation of this algorithm enables us to list L(n, n)
J.T. Tromp (John), G. Farnebäck
openaire +2 more sources
Research on Language and Computation, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Combinatorics of Differentiation
2008Let S 1 , S 2 , ... be a sequence of finite sets, and suppose we are asked to find the sequence of cardinalities s[1], s[2], .... We are usually satisfied to find a closed-form expression for the a-generating function $F_S(z) = \sum_{n \geq 0} s[n]a[n] { z^n}$, where a[n] is a fixed positive causal sequence.
Bertiger, Anna S. +2 more
openaire +2 more sources
2006
Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory.
Terence Tao, Van H. Vu
openaire +1 more source
Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory.
Terence Tao, Van H. Vu
openaire +1 more source
Studia Logica, 1988
This interesting paper is mostly concerned with Ramsey type theorems, where a theorem is of this type if it takes the form ``if certain sets are partitioned, then at least one of these parts has some particular property.'' Since a standard partition is usually considered to be a finite collection, then nonstandard methods should be of considerable ...
openaire +1 more source
This interesting paper is mostly concerned with Ramsey type theorems, where a theorem is of this type if it takes the form ``if certain sets are partitioned, then at least one of these parts has some particular property.'' Since a standard partition is usually considered to be a finite collection, then nonstandard methods should be of considerable ...
openaire +1 more source
Essentials of Tropical Combinatorics
Graduate Studies in Mathematics, 2021M. Joswig
semanticscholar +1 more source
2004
Set is a fundamental, abstract notion. A set is defined as a collection of objects, which are called the elements or points of the set. The notions of union (A ∪ B, where A and B are each sets), intersection (A ∩ B) and complement (A c ) correspond to everyday usage.
openaire +1 more source
Set is a fundamental, abstract notion. A set is defined as a collection of objects, which are called the elements or points of the set. The notions of union (A ∪ B, where A and B are each sets), intersection (A ∩ B) and complement (A c ) correspond to everyday usage.
openaire +1 more source