3628 search results - page 647 / 726 » The Decision Diffie-Hellman Problem |
DAC
2001
ACM
14 years 11 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
CADE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
CSE
2009
IEEE
14 years 4 months ago
2009
IEEE
Recent research identifies a growing privacy problem that exists within Online Social Networks (OSNs). Several studies have shown how easily strangers can extract personal data a...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...