5084 search results - page 719 / 1017 » Proving Possibility Properties |
184
click to vote
ISTCS
1997
Springer
15 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
168
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
199
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
175
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
179
click to vote
FSE
2004
Springer
15 years 10 months ago
2004
Springer
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...