An approximation notion between P and FPTAS
Computational Complexity
2026-05-08 v3
Abstract
We present an approximation notion for NP-hard optimization problems represented by binary functions. We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time algorithm.
Cite
@article{arxiv.2603.17489,
title = {An approximation notion between P and FPTAS},
author = {Samuel Bismuth and Erel Segal-Halevi},
journal= {arXiv preprint arXiv:2603.17489},
year = {2026}
}
Comments
Fixed the error. Now the proof is valid