3628 search results - page 33 / 726 » The Decision Diffie-Hellman Problem |
RTSS
2003
IEEE
14 years 2 months ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
COCO
1995
Springer
14 years 11 days ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
COR
2010
13 years 9 months ago
2010
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
PKC
1999
Springer
14 years 1 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...