5084 search results - page 11 / 1017 » Proving Possibility Properties |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
FLOPS
2010
Springer
13 years 8 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
ERSHOV
2003
Springer
14 years 3 months ago
2003
Springer
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
ECSQARU
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
INFORMATICALT
2002
13 years 9 months ago
2002
The goal of the paper is to create a model for investigating the character of relationships between the freedom and restrictions in the terrorism context, in order to find out how ...