1410 search results - page 134 / 282 » Proving theorems by reuse |
115
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...
152
Voted
IJNSEC
2006
15 years 6 months ago
2006
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
156
click to vote
IPL
2006
15 years 6 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality...
151
click to vote
JCT
2006
15 years 6 months ago
2006
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...