Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.17489 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913098175086592 |
|---|---|
| author | Bismuth, Samuel Segal-Halevi, Erel |
| author_facet | Bismuth, Samuel Segal-Halevi, Erel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17489 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An approximation notion between P and FPTAS Bismuth, Samuel Segal-Halevi, Erel Computational Complexity 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. |
| title | An approximation notion between P and FPTAS |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2603.17489 |