10054 search results - page 325 / 2011 » On the Complexity of Function Learning |
116
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
125
Voted
AMOST
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...
108
click to vote
CRYPTO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
118
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
144
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Evolutionary functional testing is an approach to automatically generating test cases that violate a certain functional system requirement. This paper proposes an approach suitabl...