9842 search results - page 120 / 1969 » Problem complexity |
PAIRING
2007
Springer
15 years 4 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
103
click to vote
ESWA
2008
14 years 8 months ago
2008
Over the years, many Artificial Intelligence (AI) approaches have dealt with the diagnosis problem and its application in complex environments such as medical domains. Model-Based...
118
click to vote
DFG
1992
Springer
15 years 2 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
ORL
2008
14 years 10 months ago
2008
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...