1998 search results - page 387 / 400 » Complexity of the Cover Polynomial |
ASIACRYPT
2004
Springer
14 years 3 months ago
2004
Springer
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
TACAS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
SIGECOM
2003
ACM
14 years 3 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
SIGECOM
2003
ACM
14 years 3 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
ATAL
2003
Springer
14 years 3 months ago
2003
Springer
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...