Sciweavers

192 search results - page 10 / 39
» Nondeterminism in Constructive Z
Sort
View
SCN
2008
Springer
14 years 9 months ago
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
Guilhem Castagnos
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
14 years 9 months ago
Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
Mathieu Dutour, Michel Deza
TIT
2008
80views more  TIT 2008»
14 years 9 months ago
Entropy Amplification Property and the Loss for Writing on Dirty Paper
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
Aaron S. Cohen, Ram Zamir
DCC
2008
IEEE
15 years 9 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball
TLCA
2009
Springer
15 years 4 months ago
On the Meaning of Logical Completeness
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
Michele Basaldella, Kazushige Terui