Title of article
On reductions to sets that avoid EXPSPACE
Author/Authors
V. Arvind، نويسنده , , J. K?bler، نويسنده , , M. Mundhenk، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1995
Pages
6
From page
109
To page
114
Keywords
computational complexity , Sparse sets , reducibilities
Journal title
Information Processing Letters
Serial Year
1995
Journal title
Information Processing Letters
Record number
128364
Link To Document