Title of article :
On the efficiency of polynomial time approximation schemes
Author/Authors :
Marco Cesati، نويسنده , , Luca Trevisan، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1997
Pages :
7
From page :
165
To page :
171
Keywords :
computational complexity , Approximation algorithms , parameterized complexity
Journal title :
Information Processing Letters
Serial Year :
1997
Journal title :
Information Processing Letters
Record number :
128784
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128784
بازگشت