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.

翻译：我们针对由二元函数表示的NP难优化问题提出一种近似概念。我们证明（假设P≠NP）该新概念严格强于FPTAS，但严格弱于存在多项式时间算法。