1410 search results - page 51 / 282 » Proving theorems by reuse |
IJNSEC
2008
13 years 10 months ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
TAP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
FCT
2005
Springer
14 years 3 months ago
2005
Springer
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
CCCG
2009
13 years 11 months ago
2009
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...