1795 search results - page 199 / 359 » On the Complexity of Circuit Satisfiability |
JMLR
2010
13 years 5 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
EUROCRYPT
2011
Springer
13 years 1 months ago
2011
Springer
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
FPL
2011
Springer
12 years 9 months ago
2011
Springer
Abstract—Soft on-FGPA interconnection networks are gaining increasing importance since they simplify the integration of heterogeneous components and offer, at the same time, a mo...
WWW
2008
ACM
14 years 11 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
ICCAD
2002
IEEE
14 years 7 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...