738 search results - page 22 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
CONCUR
2010
Springer
15 years 27 days ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
IACR
2011
13 years 11 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
100
click to vote
PKC
2010
Springer
15 years 3 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
IJAR
2007
14 years 11 months ago
2007
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...
230
click to vote
Publication
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...