520 search results - page 36 / 104 » Reductions Between Expansion Problems |
CRYPTO
2004
Springer
14 years 2 months ago
2004
Springer
Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based c...
ECIR
2007
Springer
13 years 10 months ago
2007
Springer
This paper addresses the problem of identifying collection dependent stop-words in order to reduce the size of inverted files. We present four methods to automatically recognise s...
CG
2000
Springer
14 years 1 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...