738 search results - page 20 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
103
click to vote
MOC
2011
14 years 4 months ago
2011
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
JAR
2008
14 years 9 months ago
2008
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
SIAMCOMP
2008
14 years 9 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
SCP
1998
14 years 9 months ago
1998
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...