Indivisibility and Divisibility Polytopes.
We study the polytopes of binary n-strings that encode (positive) integers that are not divisible by a partivular positive integer p - the indivisibility polytopes, as well as the more general "clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.
Year of publication: |
2000
|
---|---|
Authors: | Coppersmith, D. ; Lee, J. |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | MODELS | MATHEMATICAL ANALYSIS |
Saved in:
Saved in favorites
Similar items by subject
-
Schalk, S., (1999)
-
Competitive Equilibrium: Walras Meets Darwin.
Flam, S.D., (1999)
-
Koskela, E., (2000)
- More ...
Similar items by person