738 search results - page 23 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
122
click to vote
LFCS
1994
Springer
15 years 5 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
116
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
118
click to vote
DCC
2003
IEEE
16 years 1 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
112
click to vote
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
ARC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper presents implementation results of a reconfigurable elliptic curve processor defined over prime fields GF(p). We use this processor to compare a new algorit...