971 search results - page 13 / 195 » Approximate Satisfiability and Equivalence |
112
click to vote
PKC
2010
Springer
14 years 11 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
89
Voted
LICS
1992
IEEE
15 years 4 months ago
1992
IEEE
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
COCO
2008
Springer
15 years 2 months ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
106
Voted
IFIPTCS
2010
14 years 10 months ago
2010
Abstract. In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference)...
100
click to vote
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...