258 search results - page 40 / 52 » Some Notes on Fine Computability |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
ASM
2004
ASM
15 years 3 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
CAISE
2000
Springer
15 years 2 months ago
2000
Springer
This paper presents an approach and a tool to increase specification quality by using a combination of UML and formal languages. Our approach is based on the expression of the UML ...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...