148 search results - page 14 / 30 » On Perfect Completeness for QMA |
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
CHES
2005
Springer
14 years 1 months ago
2005
Springer
During the last years, several logic styles that counteract side-channel attacks have been proposed. They all have in common that their level of resistance heavily depends on imple...
CHES
2000
Springer
13 years 12 months ago
2000
Springer
Power analysis is a very successful cryptanalytic technique which extracts secret information from smart cards by analysing the power consumed during the execution of their interna...
ECOOP
1993
Springer
13 years 11 months ago
1993
Springer
Object-oriented programming promises to increase programmer productivity through better reuse of existing code. However, reuse is not yet pervasive in today’s object-oriented pro...
KR
2010
Springer
13 years 11 months ago
2010
Springer
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including ...