738 search results - page 26 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
COCO
2008
Springer
14 years 11 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
ICDCS
2003
IEEE
15 years 3 months ago
2003
IEEE
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...
NDSS
1999
IEEE
15 years 1 months ago
1999
IEEE
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...
FATES
2003
Springer
15 years 2 months ago
2003
Springer
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
106
click to vote
OPODIS
2003
14 years 11 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...