Sciweavers

3208 search results - page 71 / 642
» A Lower Bound for Primality
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
Linear Level Lasserre Lower Bounds for Certain k-CSPs
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
Grant Schoenebeck
AFRICACRYPT
2008
Springer
14 years 4 months ago
Lower Bounds for Subset Cover Based Broadcast Encryption
Per Austrin, Gunnar Kreitz