Title of article :
Properties of uniformly hard languages
Author/Authors :
Piotr Faliszewski، نويسنده , , Janusz Jarosz، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2005
Pages :
4
From page :
329
To page :
332
Keywords :
computational complexity , Uniform hardness , Time hierarchy , polynomial hierarchy
Journal title :
Information Processing Letters
Serial Year :
2005
Journal title :
Information Processing Letters
Record number :
130101
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130101
بازگشت