10054 search results - page 323 / 2011 » On the Complexity of Function Learning |
130
Voted
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered sec...
152
click to vote
CIE
2009
Springer
15 years 7 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
118
click to vote
DBPL
1991
Springer
15 years 7 months ago
1991
Springer
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
113
click to vote
AISC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
101
Voted
DM
2006
15 years 4 months ago
2006
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...