738 search results - page 3 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ANTS
1998
Springer
15 years 1 months ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
CHES
2000
Springer
15 years 1 months ago
2000
Springer
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
AIMSA
2000
Springer
15 years 1 months ago
2000
Springer
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
99
Voted
BIBE
2004
IEEE
15 years 1 months ago
2004
IEEE
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...
ECAI
2010
Springer
14 years 7 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...