58 search results - page 6 / 12 » Metric-Entropy Pairs on Lattices |
JOSS
2000
13 years 7 months ago
2000
: Data structures comprising many binary variables can be represented graphically in various ways. Depending on the purpose different plots might be useful. Here two ways of showin...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
ACISP
2004
Springer
14 years 28 days ago
2004
Springer
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
COMBINATORICS
2006
13 years 7 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
PQCRYPTO
2010
13 years 11 months ago
2010
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...