tokens: If the function is a constant not depending on , the algorithm is called Efficient PTAS ( EPTAS ) ; if , moreover , is polynomial in , then it is called a Fully Polynomial Time Approximation Scheme ( FPTAS ) .