7758 search results - page 42 / 1552 » On the Number of Distributive Lattices |
DCC
2011
IEEE
13 years 3 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
DISOPT
2008
13 years 8 months ago
2008
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
SWS
2004
ACM
14 years 2 months ago
2004
ACM
W3C Recommendations XML Encryption and XML-Digital Signature can be used to protect the confidentiality of and provide assurances about the integrity of XML documents transmitted...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
STOC
1999
ACM
14 years 29 days ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...