Sciweavers

1257 search results - page 178 / 252
» A generalization of Euler's constant
Sort
View
IPL
2002
93views more  IPL 2002»
13 years 7 months ago
Storing information with extractors
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
Amnon Ta-Shma
JCC
2002
61views more  JCC 2002»
13 years 7 months ago
A fast pairwise evaluation of molecular surface area
: A fast and general analytical approach was developed for the calculation of the approximate van der Waals and solvent-accessible surface areas. The method is based on three basic...
Vladislav Vasilyev, Enrico O. Purisima
JAIR
1998
92views more  JAIR 1998»
13 years 7 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
JCT
1998
76views more  JCT 1998»
13 years 7 months ago
Progressions in Sequences of Nearly Consecutive Integers
For k > 2 and r ≥ 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, ....
Noga Alon, Ayal Zaks
MOC
2002
131views more  MOC 2002»
13 years 7 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson