Year: 2013
Type: preprint
Abstract: We define a new notion of compressibility of a set of numbers through the dynamics of a polynomial function. We provide approaches to solve the problem by reducing it to the multi-criteria traveling salesman problem through a series of transformations. We then establish computational complexity results by giving some NP-completeness proofs. We also discuss about a notion of $ε$ K-compressibility of a set, with regard to lossy compression and deduce the necessary condition for the given set to be $ε$ K-compressible. Finally, we conclude by providing a list of open problems solutions to which could extend the applicability the our technique.
Source: arXiv (Cornell University)
Author: Gurumoorthy, Karthik S.
Institution: University of Florida
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1928730712