6142 search results - page 172 / 1229 » The Complexity of Partition Functions |
131
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
148
Voted
SACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
138
Voted
CASES
2010
ACM
15 years 1 months ago
2010
ACM
Mobile computing platforms in the form of smart phones, netbooks, and personal digital assistants have become an integral part of our everyday lives. Moving ahead to the future, m...
138
Voted
ADC
2006
Springer
15 years 9 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
162
click to vote
JMLR
2002
15 years 3 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...