Sciweavers

351 search results - page 70 / 71
» Classical proof forestry
Sort
View
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 7 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
MA
2010
Springer
135views Communications» more  MA 2010»
13 years 6 months ago
Nonparametric comparison of regression functions
In this work we provide a new methodology for comparing regression functions m1 and m2 from two samples. Since apart from smoothness no other (parametric) assumptions are required...
Ramidha Srihera, Winfried Stute
COCOA
2010
Springer
13 years 5 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 10 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
IACR
2011
162views more  IACR 2011»
12 years 7 months ago
The Parazoa Family: Generalizing the Sponge Hash Functions
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...
Elena Andreeva, Bart Mennink, Bart Preneel