Volume 00, Number 00, Xxxx 19xx A Natural Lattice Basis Problem With...  Home/Search
Context
Related
| belllabs.com/cm/cs/doc/94...215.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/cm/cs/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Integer lattices have numerous important applications, but some of them may have been overlooked because of the common assumption that a lattice basis is part of the problem instance. This paper gives an application that requires finding a basis for a lattice defined in terms of linear constraints. (Update)
Active bibliography (related documents): More All
2.4: A Natural Lattice Basis Problem With Applications - Hobby (1994) (Correct)
0.3: Towards a Universal Auto-Hinting System for Typographic Shapes - Herz, Hersch (Correct)
0.2: Dynamic Optical Scaling and Variable-Sized Characters - André, Vatton (1994) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ xxxx-series,
author = "Volume Number Xxxx",
title = "Series Logo",
url = "citeseer.ist.psu.edu/753788.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1981
352 A course in computational algebraic number theory (context) - Cohen - 1993
227 Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
100 Integer programming with a fixed number of variables (context) - Lenstra - 1983
66 On Lov'asz' lattice reduction and the nearest lattice point .. (context) - Babai - 1986
38 Solving simultaneous modular equations of low degree (context) - Hastad - 1988
33 A polynomial time algorithm for breaking the basic merkle-he.. (context) - Shamir - 1984
33 Polynomial-time algorithms for finding integer relations amo.. (context) - Hastad, Just et al. - 1989
32 A monte carlo method for factorization (context) - Pollard - 1975
21 Reconstructing truncated integer variables satisfying linear.. (context) - Frieze, Hastad et al. - 1988
14 Cryptanalytic attacks on the multiplicative knapsack cryptos.. - Odlyzko - 1984
10 Approximating rings of integers in number fields - Buchmann, Lenstra - 1994
4 The design of a Unicode font - Bigelow, Holmes - 1993
3 Generating automatically tuned bitmaps from outlines - Hobby - 1993
2 Improved rounding for spline coefficients and knots - Grosse, Hobby - 1994
2 A modification of the LLL-algorithm (context) - Pohlst - 1987
2 On finite-precision representatins of geometric objects (context) - Sugihara - 1989
1 An infinite precision integer package for c (context) - Gansner - 1987
Documents on the same site (http://cm.bell-labs.com/cm/cs/papers.html): More
Local Control over Filtered WWW Access - Baker, Grosse (1995) (Correct)
Parameterized Pattern Matching by Boyer-Moore-type Algorithms - Baker (1995) (Correct)
Determining Subspace Information from the Hessian of a Barrier.. - Wright (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC