Sciweavers

7758 search results - page 12 / 1552
» On the Number of Distributive Lattices
Sort
View
CALC
2001
Springer
161views Cryptology» more  CALC 2001»
14 years 1 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin
EUSFLAT
2007
108views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Lattice-Valued Possibilistic Entropy Functions
Lattice-valued entropy functions defined by a lattice-valued possibilistic distribution π on a space Ω are defined as the expected value (in the sense of Sugeno integral) of ...
Ivan Kramosil
IGPL
2011
13 years 3 months ago
Completion and amalgamation of bounded distributive quasi lattices
In this note we present a completion for the variety of bounded distributive quasi lattices, and, inspired by a well-known idea of L.L. Maksimova [14], we apply this result in prov...
Majid Alizadeh, Antonio Ledda, Hector Freytes
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 8 months ago
Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices
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...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 9 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen