Title of article :
A decidable characterization of the classes between lintime and exptime
Author/Authors :
Salvatore Caporaso، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2006
Pages :
5
From page :
36
To page :
40
Keywords :
Implicit computational complexity , Theory of computation , computational complexity
Journal title :
Information Processing Letters
Serial Year :
2006
Journal title :
Information Processing Letters
Record number :
130180
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130180
بازگشت