50 search results - page 2 / 10 » Constructive Notions of Maximality for Ideals |
APAL
2005
13 years 5 months ago
2005
Let A [] be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indest...
ESORICS
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Key exchange protocols in the setting of universal composability are investigated. First we show that the ideal functionality FKE of [9] cannot be realized in the presenc...
TIT
2011
13 years 14 days ago
2011
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...