281 search results - page 21 / 57 » heuristics 2000 |
CBMS
2009
IEEE
14 years 4 months ago
2009
IEEE
The category of institution or organization underwriting the research reported in a scientific article is a required field (Grant Support type) in the bibliographic record of that...
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
DIS
2000
Springer
14 years 2 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
ASPDAC
2000
ACM
14 years 1 months ago
2000
ACM
We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to re...
CL
2000
Springer
14 years 1 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...