1243 search results - page 14 / 249 » Complexity reduction of C-Algorithm |
COCOON
2009
Springer
14 years 10 months ago
2009
Springer
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Existing tone-reservation algorithms (such as the controlled clipper algorithm) for OFDM require a number of iterations to ensure the reduction of Peak-to-Average Power Ratio (...
EUSFLAT
2001
14 years 11 months ago
2001
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...