47 search results - page 8 / 10 » The 1.5D sieve algorithm |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
ML
2007
ACM
13 years 10 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
ICCD
2001
IEEE
14 years 7 months ago
2001
IEEE
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...