523 search results - page 63 / 105 » On the Power of Quantum Proofs |
108
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
AB
2007
Springer
15 years 6 months ago
2007
Springer
Whenever a programmer writes a loop, or a mathematician does a proof by induction, an invariant is involved. The discovery and understanding of invariants often underlies problem s...
ASM
2005
ASM
15 years 5 months ago
2005
ASM
AsmL is a novel executable specification language based on the theory of State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs...
WAOA
2004
Springer
15 years 5 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
ACISP
2008
Springer
15 years 1 months ago
2008
Springer
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...