3628 search results - page 402 / 726 » The Decision Diffie-Hellman Problem |
138
click to vote
FOCS
2003
IEEE
16 years 1 days ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
221
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
189
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
175
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
280
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...