Amanote Research
Register
Sign In
Moderately Hard Functions: From Complexity to Spam Fighting
Lecture Notes in Computer Science
- Germany
doi 10.1007/978-3-540-24597-1_37
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Science
Theoretical Computer Science
Date
January 1, 2003
Authors
Moni Naor
Publisher
Springer Berlin Heidelberg
Related search
The Complexity of Constructing Pseudorandom Generators From Hard Functions
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Spam Fighting in Social Tagging Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fighting Hard Core Cartels
Crustal Complexity in the Lachlan Orogen Revealed From Teleseismic Receiver Functions
Australian Journal of Earth Sciences
Earth
Planetary Sciences
Theoretical Studies of the Correlations in Moderately Asymmetric Binary Hard-Sphere Solid Mixtures
Physical Review E
The Complexity of Real Recursive Functions
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fighting to Be Heard
Classes of Boolean Functions With Limited Complexity
Prikladnaya diskretnaya matematika. Prilozhenie
On Communication Complexity of Vector-Valued Functions
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
