Better and Simpler Reducibility Bounds over the Integers
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910804579713024 |
|---|---|
| author | Levin, Asaf |
| author_facet | Levin, Asaf |
| contents | We study the settings where we are given a function of n variables defined in a given box of integers. We show that in many cases we can replace the given objective function by a new function with a much smaller domain. Our approach allows us to transform a family of weakly polynomial time algorithms into strongly polynomial time algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17638 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Better and Simpler Reducibility Bounds over the Integers Levin, Asaf Optimization and Control Discrete Mathematics Data Structures and Algorithms 90C10 We study the settings where we are given a function of n variables defined in a given box of integers. We show that in many cases we can replace the given objective function by a new function with a much smaller domain. Our approach allows us to transform a family of weakly polynomial time algorithms into strongly polynomial time algorithms. |
| title | Better and Simpler Reducibility Bounds over the Integers |
| topic | Optimization and Control Discrete Mathematics Data Structures and Algorithms 90C10 |
| url | https://arxiv.org/abs/2501.17638 |