738 search results - page 25 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
CHES
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
94
Voted
AAECC
1997
Springer
15 years 1 months ago
1997
Springer
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
JSAT
2008
14 years 9 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
CGI
2003
IEEE
15 years 3 months ago
2003
IEEE
Visualization of distributed processes is useful for the management of large-scale distributed computing systems. Reactivity and scalability are especially important requirements ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...