8824 search results - page 100 / 1765 » On the Complexity of Real Functions |
150
click to vote
EUROCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
160
click to vote
CASCON
2010
15 years 2 months ago
2010
Today, we are witnessing a new level of scale, complexity, and pervasiveness of software systems that are designed to support much more holistically complex processes. Much richer...
123
click to vote
DAM
2007
15 years 4 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
165
Voted
IFL
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
116
click to vote
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...