13784 search results - page 393 / 2757 » On Computing Functions with Uncertainty |
150
click to vote
JOC
2002
15 years 6 months ago
2002
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
136
click to vote
MOC
2002
15 years 6 months ago
2002
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
164
click to vote
IPL
2010
15 years 5 months ago
2010
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash functio...
142
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
227
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...