Báo cáo toán học: "One Pile Nim with Arbitrary Move Function" pdf

... alt =""

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 15:20

... alt =""

Ngày tải lên: 05/08/2014, 15:20

... alt =""

Ngày tải lên: 05/08/2014, 15:21

... alt =""

Ngày tải lên: 05/08/2014, 15:21

... alt =""

Ngày tải lên: 05/08/2014, 15:21

... alt =""

Ngày tải lên: 05/08/2014, 15:21

... alt =""

Ngày tải lên: 05/08/2014, 15:21

... permutation π n Recognizing Group Languages with OBDDs 371 For a fixed n,anordering of the variables x 1 ,x 2 , ,x n is a permutation π on the set {1, 2, ,n}, i.e., an element of the symmetric group S n .Wenowde- fine ... the OBDD computes the Boolean function. Fig. 1. An OBDD with the permutation π(1) =2, π(2) =4, π(3) =3, π(4) =1 Recognizing Group Languages with OBDDs 37...

Ngày tải lên: 06/08/2014, 04:21

... ✷ Summarizing, we now know all extremal graphs, G with f (G)=2δ +1. The connected extremal graphs are those given in Theorem 3 along with the trivial ones with only 2δ + 1 vertices. We noticed that ... the sense that there exist graphs of minimum degree δ with no longer paths. Our purpose in this article is to characterize all such extremal graphs. For a graph G with...

Ngày tải lên: 07/08/2014, 06:20

... towards accounting for the wastefulness of the first moment method. Instead of Almost all graphs with 2.522n edges are not 3-colorable Dimitris Achlioptas ∗ optas@cs.toronto.edu Michael Molloy † molloy@cs.toronto.edu Department ... in that the selection is done with replacement, i.e. multiple edges are allowed. We will denote this model by G r (n, m). Intuitively, it is cl...

Ngày tải lên: 07/08/2014, 06:20

... =1, |V i | = F i for 1 ≤ i ≤ n, |V 0 n | =1and |V i n | = F i for 1 ≤ i ≤ n − 2. On Minimal Words With Given Subword Complexity Ming-wei Wang ∗ Department of Computer Science University of Waterloo Waterloo, ... 2 1. What is the length of a minimal word of order N? 2. Is there a reasonably efficient algorithm that finds such minimal words? 3. For each order how many minimal w...

Ngày tải lên: 07/08/2014, 06:22

... behavior of f(n, p, q) between the linear and quadratic orders of magnitude, so for q lin ≤ q ≤ q quad . In particular we show that that we can have at most log p values of q which give a linear ... denotes the parity of the natural number n,soitis1ifn is odd and 0 otherwise. 1.2 Edge colorings with at least q colors in every subset of p vertice...

Ngày tải lên: 07/08/2014, 07:21

... position (N, x) is called unsafe if it is unsafe to move to it. Since the player who moves to an unsafe position loses with best play, the player who moves from an unsafe position can always win. Similarly, ... ≥ g(N). We can now state the main theorem. Main theorem: Suppose we play our game with an arbitrary but fixed move function f : Z + → Z + . Suppose f generates the g-base B f...

Ngày tải lên: 07/08/2014, 07:21

... = |U 0 | + 1. Thus all Zelinka graphs have toughness less than one. 3 Maximal nontraceable graphs with toughness less than one Suppose P is a path in a graph G, with endvertices a and z. If we ... of 2-connected non-Zelinka MNT graphs with toughness less than 1. the electronic journal of combinatorics 15 (2008), #R18 2 Maximal Nontraceable Graphs with T...

Ngày tải lên: 07/08/2014, 15:23