539 search results - page 108 / 108 » An Improved Upper Bound for SAT |
CRYPTO
2011
Springer
12 years 5 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
IACR
2011
12 years 5 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
SOSP
2007
ACM
14 years 2 months ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...