468 search results - page 18 / 94 » One-Way Functions in Complexity Theory |
PKC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
100
click to vote
ECAL
1995
Springer
15 years 2 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
116
click to vote
HASKELL
2005
ACM
15 years 4 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
ATAL
2006
Springer
15 years 2 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
ECAL
2007
Springer
15 years 5 months ago
2007
Springer
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...