738 search results - page 9 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
ANTS
2008
Springer
14 years 11 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
INTETAIN
2005
Springer
15 years 3 months ago
2005
Springer
PeaceMaker is a computer game simulation of the Israeli-Palestinian conflict. It is a tool that can be used to teach Israeli and Palestinian teenagers how both sides can work toget...
LPAR
1994
Springer
15 years 1 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
79
Voted
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a method for redundancy identification (RID) using multi-node logic implications. The algorithm discovers a large number of direct and indirect implications b...