Sciweavers

15 search results - page 3 / 3
» Computing the Density of States of Boolean Formulas
Sort
View
FOSSACS
2005
Springer
15 years 3 months ago
Duality for Logics of Transition Systems
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
Marcello M. Bonsangue, Alexander Kurz
ICALP
2007
Springer
15 years 3 months ago
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
CONCUR
2000
Springer
15 years 1 months ago
The Control of Synchronous Systems
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
FSTTCS
2009
Springer
15 years 4 months ago
Functionally Private Approximations of Negligibly-Biased Estimators
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
André Madeira, S. Muthukrishnan
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 4 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira