195 search results - page 37 / 39 » How to talk to a hologram |
84
Voted
CRYPTO
2003
Springer
15 years 2 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
73
Voted
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
SIGUCCS
2009
ACM
15 years 2 months ago
2009
ACM
Frontline support and maintenance for desktop hardware and software systems at Princeton University has been uniquely structured, allowing the benefits of centralization and the f...
CPM
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
CRYPTO
2000
Springer
15 years 1 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...