1679 search results - page 17 / 336 » Strong order equivalence |
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Checking the equivalence of a system-level model against an RTL design is a major challenge. The reason is that usually the system-level model is written by a system architect, ...
104
click to vote
ESSLLI
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
ESOP
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...