1871 search results - page 42 / 375 » The Ephemeral Pairing Problem |
150
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
167
click to vote
IOR
2006
15 years 6 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
145
click to vote
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
193
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
169
click to vote
FORMATS
2005
Springer
15 years 11 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...