256 search results - page 12 / 52 » Recursive Lattice Reduction |
44
Voted
CORR
2006
Springer
15 years 13 days ago
2006
Springer
100
click to vote
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
70
Voted
TSP
2008
15 years 8 days ago
2008
An array-based algorithm for multichannel lattice filtering is proposed. The filter is formed by a set of units that are adapted locally and concurrently using recursions that clos...
78
Voted
COCO
1998
Springer
15 years 4 months ago
1998
Springer
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
91
Voted
STOC
2007
ACM
16 years 21 days ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...