Don Coppersmith, Jon Lee  Home/Search
Context
Related
| uky.edu/~math/MAreport/PDF/0019.pdf core.ucl.ac.be/services...dp200031.pdf 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: uky.edu/~math/MAreport/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positiveinteger p ---the indivisibility polytopes,aswell as the more general "clipped cubes". Also, we discuss a potential application to factoring. Finally,we presentsome results concerning divisibility polytopes. Keywords: integer program, polytope, clipped cube, totally dual integral, ideal matrix, generalized set covering, binary encoding, divisible, factoring. 1 Dept. of... (Update)
Active bibliography (related documents): More All
4.4: Indivisibility And Divisibility Polytopes - Coppersmith, Lee (2000) (Correct)
0.5: Balanced Matrices - Conforti, Cornuéjols (2001) (Correct)
0.5: Ideal Clutters - Cornuéjols, Guenin (2001) (Correct)
Similar documents based on text: More All
0.2: New Upper Bounds for Maximum-Entropy Sampling - Hoffman, Lee, Williams (2000) (Correct)
0.1: Primes In Elliptic Divisibility Sequences - Einsiedler, Everest, Ward (Correct)
0.1: On Rational and on Left Divisibility Monoids - Kuske (1999) (Correct)
BibTeX entry: (Update)
@misc{ coppersmith-indivisibility,
author = "Don Coppersmith and Jon Lee",
title = "Indivisibility And Divisibility Polytopes",
url = "citeseer.ist.psu.edu/lee00indivisibility.html" }
Citations (may not include all citations):1065 Handbook of applied cryptography (context) - Menezes, van Oorschot et al. - 1997
333 Geometric algorithms and combinatorial optimization (context) - Grotschel, Alexander - 1993
257 Elliptic curve cryptosystems (context) - Koblitz - 1987
134 Factoring integers with elliptic curves (context) - Lenstra - 1987
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Alexander et al. - 1984
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Alexander - 1981
68 Small solutions to polynomial equations (context) - Coppersmith - 1997
55 Theorems on factorization and primality testing (context) - Pollard - 1974
51 The multiple polynomial quadratic sieve (context) - Silverman - 1987
35 Factoring integers with the number field sieve (context) - Buhler, Lenstra et al. - 1993
34 volume 152 of Graduate Texts in Mathematics (context) - Ziegler, polytopes - 1995
30 Theory and practice (context) - Stinson, CRC et al. - 1995
29 Wiley-Interscience Series in Discrete Mathematics and Optimi.. (context) - Nemhauser, Wolsey et al. - 1988
28 Optimization methods for logical inference (context) - Chandru, Hooker - 1999
24 Finding a small root of a bivariate integer equation# factor.. (context) - Coppersmith - 1996
20 NFS with four large primes: an explosive experiment (context) - Dodson, Lenstra - 1995
18 Alpha-balanced graphs and matrices and GF (context) - Truemper - 1982
14 Finding small roots of univariate modular equations revisite.. (context) - Howgrave-Graham - 1997
12 Factorization and primality testing (context) - Bressoud - 1989
11 A class of logic problems solvable by linear programming (context) - Conforti, Cornu'ejols - 1995
11 The Hirsch conjecture is true (context) - Naddef - 1989
10 bicoloring and total dual integrality (context) - Conforti, Cornu'ejols et al. - 1995
10 Effective logic computation (context) - Truemper - 1998
10 Mathematical Programming (context) - Berge - 1972
8 Note sur les Q-matrices d'Edmonds (context) - Edmonds, Maurras - 1997
7 Pivot and complement --- a heuristic for 0-1 programming (context) - Balas, Martin - 1980
6 Geometric comparison of combinatorial polytopes (context) - Lee, Morris - 1994
5 Nordisk Tidskrift for Informationsbehandling (context) - Pollard, Carlo et al. - 1975
5 Combinatorial Optimization: Packing and Covering (context) - Cornu'ejols - 1999
4 Mathematical Programming (context) - Nobili, Sassano et al. - 1998
3 The volume of relaxed Boolean-quadric and cut polytopes - Ko, Lee et al. - 1997
2 A polytope for a product of real linear functions in 0=1vari.. (context) - Coppersmith, Lee et al. - 1999
2 Exact pivoting without the Euclidean algorithm (context) - Edmonds - 1994
2 A decomposition of 2-weak vertex-packing polytopes - Steingr'imsson - 1994
2 A note on the pivot and complement heuristic for 0-1 program.. (context) - Aboudi, Hallefjord et al. - 1989
Documents on the same site (http://www.ms.uky.edu/~math/MAreport/): More
Non-Nested Multigrid Methods for Linear Problems - Bittencourt, Douglas.. (Correct)
Homotopy Groups of Connected Envelopes of Compact Abelian Groups - Enochs (Correct)
Global Existence of Strong Solutions to the Three-Dimensional.. - Riley (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