Title of article
On sparseness, reducibilities, and complexity
Author/Authors
Cucker، نويسنده , , Felipe، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
9
From page
53
To page
61
Abstract
We prove several results about the existence of sparse sets complete (and hard) for Turing reductions on different settings and complexity classes over the real numbers.
Keywords
sparse sets , Real computation , Turing reductions
Journal title
Annals of Pure and Applied Logic
Serial Year
2005
Journal title
Annals of Pure and Applied Logic
Record number
1444161
Link To Document