Year: 2025
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Levin, Asaf
Institution: Technion – Israel Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Israel Science Foundation
Award: G373497666
OpenAlex ID: W4406975655