2 search results - page 1 / 1 » MAX3SAT is exponentially hard to approximate if NP has posit... |
TCS
2002
13 years 5 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...