Better and Simpler Reducibility Bounds over the Integers
Optimization and Control
2025-01-30 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.2501.17638,
title = {Better and Simpler Reducibility Bounds over the Integers},
author = {Asaf Levin},
journal= {arXiv preprint arXiv:2501.17638},
year = {2025}
}