295 search results - page 43 / 59 » SAT, SMT and Applications |
118
Voted
EUROCRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
109
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
139
Voted
SAT
2009
Springer
15 years 8 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
104
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Circuit fabrics composed of highly regular structures, called logic bricks, have been described recently for improving yield. An automated logic brick design flow based on a SAT ...
106
click to vote
SAT
2004
Springer
15 years 7 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...