3040 search results - page 75 / 608 » Independent Natural Extension |
DM
2000
13 years 9 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...
TSP
2012
12 years 4 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...
EUSFLAT
2001
13 years 10 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...
JCT
2006
13 years 9 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...
EUROCRYPT
2000
Springer
14 years 22 days 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...