3040 search results - page 75 / 608 » Independent Natural Extension |
156
click to vote
DM
2000
15 years 3 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
142
Voted
TSP
2012
13 years 11 months ago
2012
—Modeling natural and artificial systems has played a key role in various applications and has long been a task that has drawn enormous efforts. In this work, instead of explori...
127
Voted
EUSFLAT
2001
15 years 5 months ago
2001
In this paper we shall describe a very natural extension of MV-algebras, the divisible MV-algebras (DMV). Such algebraic structures will be used to give a formal description of ru...
112
Voted
JCT
2006
15 years 3 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
152
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...