2088 search results - page 301 / 418 » The Probabilistic Method |
119
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
115
click to vote
CC
1998
Springer
15 years 2 months ago
1998
Springer
We introduce the natural class SP 2 containing those languages which may be expressed in terms of two symmetric quanti ers. This class lies between P 2 and P 2 P 2 and naturall...
113
click to vote
JCT
2002
15 years 2 months ago
2002
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
142
click to vote
MOC
2002
15 years 2 months ago
2002
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...
145
click to vote
MOBIHOC
2010
ACM
15 years 1 months ago
2010
ACM
Comparing with the classical barcode system, RFID extends the operational distance from inches to a number of feet (passive RFID tags) or even hundreds of feet (active RFID tags)....