1795 search results - page 82 / 359 » On the Complexity of Circuit Satisfiability |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper studies the dissipativity properties of full order dynamic models of synchronous generators. It is shown that, under widely accepted assumptions, these models satisf...
AAAI
1994
13 years 10 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
CRYPTO
2010
Springer
13 years 10 months ago
2010
Springer
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
FPGA
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we introduce a reconfigurable fabric based around a new class of circuit element: the hybrid Hall effect (HHE) magnetoelectronic device. Because they incorporate a ...